MATH 570 - Combinatorics

Units: 3
Three hours lecture per week
Prerequisite(s): Graduate Standing or Permission of Instructor
Study of arrangements, patterns, designs, assignments, schedules, connections, and configurations. Existence problems, counting methods and optimization issues. Applications include graphs, networks, experimental design, coding theory, and combinatorial optimization.