MATH 28530
Honors Graph Theory
This course covers the basics of the theory of finite graphs. Topics include shortest paths, spanning trees, counting techniques, matchings, Hamiltonian cycles, chromatic number, extremal graph theory, Turan's theorem, planarity, Menger's theorem, the max-flow/min-cut theorem, Ramsey theory, directed graphs, strongly connected components, directly acyclic graphs, and tournaments. Techniques studied include the probabilistic method.
Topics
- shortest paths
- spanning trees
- counting techniques
- matchings
- Hamiltonian cycles
- chromatic number
- extremal graph theory
- Turan's theorem
- planarity
- Menger's theorem
- the max-flow/min-cut theorem
- Ramsey theory
- directed graphs
- strongly connected components
- directly acyclic graphs
- and tournaments
Topics explicitly listed in official catalogue description
Sources
- Course catalogue ↗2026-2027