MATH 581 F1 - Extremal Graph Theory
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. Course Information: Same as CS 572. Prerequisite: MATH 580 or consent of instructor.
Restricted to Graduate - Urbana-Champaign. Not intended for MS:Economics:Policy Econ -UIUC, MS:Economics:Policy Econ -UIUC, MS: Financial Engineering, MENG:Mechanical Enginerng-UIUC, MENG:Elec & Computer Eng-UIUC, or MENG:Engineering:Comp Eng-UIUC
Academic Program Restrictions:
Option 1Number of Required Visit(s): 0
Course Level: Graduate