MATH 581 / CS 572
EXTREMAL GRAPH THEORY, Fall 2007
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.
Resources (in postscript or html)
- Course announcement
- Books on library reserve
- SUMMARY of lectures in Fall 2007
- List of known TYPOS in Fall 2007
pre-publication printing of text
- Fall 2007 Homework:
1,
2,
3,
4,
5,
6,
7,
8,
9.
- Drawing pictures with gpic: discussion,
macro package
- Archive: summary of lectures in
Spring 2006,
Spring 2004
- Archive: TYPOS in earlier versions of text:
Spring 2006,
Spring 2004
- Archive: Spring 2006 Homework:
1,
2,
3,
4,
5,
6,
7,
8,
9.