MTH-330 Combinatorics and Graph Theory

Prerequisite: MTH-260
A study of the primary methods and fundamental ideas of combinatorics and graph theory. Topics covered include generating functions, set partitions, recurrence relations, inclusion-exclusion, trees, graph connectivity, independence, and graph colorings. Additional topics will be chosen from Ramsey theory, set systems, planarity, directed graphs, matchings, and Hamiltonian and Eulerian graphs. 4 credits.