MATH 421 - Combinatorics

Credit Hours: 4
Frequency of Offering: Offered in alternate years, usually in the fall semester

Topics may include the following: permutations, combinations, partitions, counting principles, generating functions, partially ordered sets, designs and codes, graphs and trees, planarity, networks, Hamiltonian cycles, Eulerian tours, combinatorial designs, games of complete information, asymptotic methods, combinatorial existence theorems and Ramsey theory.

Prerequisite(s): MATH 281 or permission of the instructor.