and collect it the following Tuesday. No late HW.

Click here for the assignments.

- Chapter 1:
- walks, paths, and trails
- Eulerian circuits
- degree sequences
- directed graphs; deBruijn sequences

- Extra topic: Sperner's Lemma
- Extra topic: Random graphs; the Rado graph
- Chapter 2:
- spanning trees
- min weight spanning trees; Kruskal's Algorithm
- Matrix Tree Theorem
- Prufer codes; tree enumeration

- Extra topic: Cayley graphs; Conway's Tribones
- Chapter 3:
- Hall's matching criterion; Marriage Theorem
- augmenting path algorithm
- weighted matching; Hungarian algorithm
- Gale-Shapley proposal algorithm
- Tutte's matching theorem; 1-factors

- Extra Topic: Ramsey's Theorem
- Chapter 4:
- connectivity in graphs
- ear decompositions
- Menger's Theorem
- network flows; Max Flow/Min Cut

- Extra topic: matroids
- Chapter 5:
- graph coloring; color critical graphs
- 5-color Theorem for planar graphs
- Brooks's Theorem
- Turan's extremal Theorem
- the chromatic polynomial

- Extra Topic: more about Matroids
- Chapter 6:
- Euler characteristic;
- Kuratowski's Theorem