This course is Jim Geelen’s favourite course, instead of CO 446, because this course directly starts on theorems and proofs thanks to the foundations of previous courses. His offering during Fall 2012 can be found on jlazovskis.com.

Luke’s version has strong bias towards coloring, because of his research area.

These notes cover advanced graph theory. Topics include graph coloring (Brooks’ theorem, Vizing’s theorem, list coloring, discharging), graph minors (well-quasi-ordering, tree-width, brambles, Hadwiger’s conjecture), extremal graph theory (Turán’s theorem, Ramsey theory, Szemerédi regularity lemma), the probabilistic method, and network flows.