MAT 321 COMBINATORICS

A continuation of the study of combinatorial theory and methods introduced in Discrete Mathematics. Topics may include enumeration techniques, generating functions, solving recurrence relations, partially ordered sets, the principle of inclusion and exclusion, equivalence relations, matroids, Latin squares, graph theory, and Polya’s enumeration theorem.