| Jan 7 | Induction (review) (Section 2) |
| Jan 9 |
Basic counting principles Permutations (Section 3.1) |
| Jan 11 | Words (Section 3.2) Choice problems (Section 3.3) |
| Jan 14 | Choice problems (Section 3.3) HW1 due |
| Jan 16 | Binomial theorem (Section 4.1) Multinomial theorem (Section 4.2) |
| Jan 18 | Inclusion-exclusion (Section 7) |
| Jan 21 | No class |
| Jan 22 | HW2 due at noon |
| Jan 23 | Eulerian trails (Section 9.1) |
| Jan 25 | Eulerian trails (Section 9.1) Directed graphs (Section 9.3, just definitions and directed version of Euler's theorem) Hamiltonian cycles (Section 9.2, just definitions) |
| Jan 28 | Review HW3 due |
| Jan 30 | Midterm 1 |
| Feb 1 | Hamiltonian cycles (Section 9.2) Graph isomorphisms (Section 9.4) |
| Feb 4 | Trees (Section 10.1 except Cayley's formula) |
| Feb 6 | Adjacency matrices (Section 10.3) Deletion-contraction (Section 6.3 of notes) Statement of matrix-tree theorem |
| Feb 8 | Matrix-tree theorem (Section 10.4, though we will follow Sections 6.4-6.5 in notes for proof) |
| Feb 11 | Matrix-tree theorem examples (Cayley's theorem) HW4 due |
| Feb 13 | Minimum weight spanning trees (Section 10.2) |
| Feb 15 | Graph colorings and chromatic polynomials (Section 11.1, section 7.1 of notes) |
| Feb 18 | No class |
| Feb 19 | HW5 due at 3pm |
| Feb 20 | Bipartite graphs (Section 11.2) Matchings (Section 11.3) |
| Feb 22 | Matchings (Section 11.3) |
| Feb 25 | Midterm review HW6 due |
| Feb 27 | Midterm 2 |
| Mar 1 | Planar graphs (Sections 8.1-8.2 of notes) |
| Mar 4 |
Obstructions to planarity (Section 8.3 of notes) Coloring planar maps (Section 8.4 of notes) |
| Mar 6 | Ramsey theory for graphs (Section 13.1 of book and Section 9.2 of notes) |
| Mar 8 | Ramsey theory for graphs (Section 13.1 of book and Section 9.2 of notes) |
| Mar 11 | Lower bounds for Ramsey numbers (Section 15.2) Erdős-Szekeres numbers (Section 13.2) HW7 due |
| Mar 13 | Review |
| Mar 15 | Review |
| Mar 20 | Final exam: 11:30AM-2:29PM |