Combinatorics

(4 Credits)

Techniques for counting and enumeration including generating functions, the principle of inclusion and exclusion, and Polya counting. Graph theory. Modern algorithms and data structures for graph-theoretic problems. | Prerequisite: C or better in MA-UY 1124 or MA-UY 1424.