Extremal Graph Theory credit:

4 Hours

Extremal problems and parameters for graphs. Distance and connectivity, matching and factors, vertex and edge colorings, perfect and imperfect graphs, intersection classes and intersection parameters, Turan's theorem, graph Ramsey theory, graph decomposition and other extremal problems. Same as CS 572 . Prerequisite: MATH 580 or consent of instructor.