Introduction to Combinatorics

Catalog description

The pigeonhole principle. Basic discrete structures and their enumeration: permutations, combinations, partitions, Catalan numbers. Generalizations of the binomial theorem and related identities. The principle of inclusion-exclusion. Recurrence relations and generating functions. Introduction to graph theory: Eulerian walks, Hamiltonian cycles, trees, matchings, coloring maps. Prerequisite(s): A MAT 221 or A MAT 299. Offered fall semester only.