# MATH 581 / CS 572

## EXTREMAL GRAPH THEORY, Spring 2011

This is an advanced graduate course in extremal graph theory. Students are
expected to be familiar with basic graph theory as discussed in Math 412 or Math
580. Prior study of algorithmic graph theory may be adequate preparation.
Fundamental results in extremal graph theory from prior courses will be derived
as needed. Main topics include Trees and distance, Matching and factors,
Colorings, Perfect graphs, and Other extremal problems.
The text for this semester will be available at TIS Bookstore for $25-30
at or near the start of classes.

### Resources (in postscript or html)

- Course announcement
- Books on library reserve
- SUMMARY of lectures in Spring 2011
- List of known
*TYPOS* in Spring 2011
pre-publication printing of text
- Spring 2011 Homework:
1,
2,
3,
4,
5,
6,
7,
8,
9.
- Drawing pictures with gpic: discussion,
macro package
- Archive: summary of lectures in
S'2009,
F'2007,
S'2006,
S'2004
- Archive: TYPOS in earlier versions of text:
S'2009,
F'2007,
S'2006,
S'2004
- Archive: S'2009 Homework:
1,
2,
3,
4,
5,
6,
7,
8,
9.
- Archive: F'2007 Homework:
1,
2,
3,
4,
5,
6,
7,
8,
9.
- Archive: S'2006 Homework:
1,
2,
3,
4,
5,
6,
7,
8,
9.