MATH 471 - Combinatorics (3)

Analyze discrete structures, including existence, enumeration, and optimization. Permutations and combinations, combinatorial identities, the inclusion-exclusion principle, recurrence relations, Polya counting. Basic definitions and properties of graphs, Eulerian and Hamiltonian graphs, trees, graph colorings and chromatic number, planar graphs.

Prerequisite: MATH 302 or MATH 307 with a C (2.0) or better; or graduate standing.

400-level Undergraduate Course available for Graduate Credit