MATH 581

spring 2006
 
All Classes
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.

Closed
Section Status Closed
Open
Section Status Open
Pending
Section Status Pending
Open (Restricted)
Section Status Open (Restricted)
Unknown
Section Status Unknown
Section Status updates every 10 minutes.
Detail Status CRN Type Section Time Day Location Instructor