MATH 316 - Graph Theory and Combinatorics

Unit(s): 4

A study of combinatorics, probability, and graph theory. Topics will include the elements of set theory, counting techniques such as permutations and combinations, discrete probability, Hamiltonian and Eulerian properties of graphs, graph isomorphism, coloring and planarity. Additional topics may include the pigeonhole principle, the inclusion-exclusion principle, generating functions, partitions and recurrence relations, Polya’s theorem, matching, and trees, with applications in many disciplines. Students may not earn credit for both Math 316 and MATH 416.

Prerequisite(s): Prerequisite: Grade of C- or better in MATH 220 or MATH 142 or CS 242 or consent of instructor.
Typically Offered Spring Only May Be Repeated Repeatable for credit.
Grading: OPT