MTH 345: Combinatorics and Graph Theory
This advanced course in discrete mathematics emphasizes counting and finite structures. The material is taken from three broad areas of combinatorics: counting theory, graph theory and design theory. Topics include fundamental laws of counting, generating functions, recursion, partitions, existence and optimization problems, graphs and digraphs, networks, the relationships between graphical invariants, lattices, simple game theory, Latin squares, design and coding theory, and Ramsey Theory. Prerequisite: MTH 210.