| Week | Lecture dates | Sections | HW assignment |
|---|---|---|---|
| 1 | 1/13, 1/15 | Basics, Turan Problem for C4 | Review Chapter 0 in the notes |
| 2 | 1/20, 1/22 | Turan Problems for Cliques and Trees | Chapter 0: 1, 4. Chapter 1: 3abc, 4ab |
| 3 | 1/27, 1/29 | Dirac Problems, The Adjacency Matrix | Chapter 1: 8, 9ab, 10 |
| 4 | 2/3, 2/5 | Beyond Adjacency Matrices, Diagonal Ramsey | Chapter 1: 13, 14. Chapter 2: 1a, 4 |
| 5 | 2/10, 2/12 | Multicolor Ramsey, Proper Colorings and Variants | Chapter 10: 1, 5ab, 7 |
| 6 | 2/17, 2/19 | Clique and Chromatic Numbers, Deletion Arguments, DRC | Chapter 3: 6ab, 7, 9c |
| 7 | 2/24, 2/26 | Matchings, Flows | Chapter 4: 3, 4, 8, 13a |
| 8 | 3/3, 3/5 | Inteeger Programs, Regularity Lemma | Chapter 4: 16; Chapter 7: 1a, 2a, 3b |
| 9 | 3/10, 3/12 | ??Regularity, Supersaturation | Chapter 5: 3, 5; Chapter 6: 4 |
| 10 | 3/17, 3/19 | Spring Break (No Classes) | N/A |
| 11 | 3/24, 3/26 | ??Supersaturation | Chapter 8: 4d, 5 |
| 12 | 3/31, 4/2 | ??Stability, Hypergraphs | Chapter 8: 7abc |
| 13 | 4/7, 4/9 | ??Hypergraph Containers | Chapter 9: 2, 3b, 4b |
| 14 | 4/14, 4/16 | ??Entropy | Chapter 9: 8; Chapter 11: 3, 4a |
| 15 | 4/21, 4/23 | ??Spectral Graph Theory | (Optional) Chapter 11: 5, 6 |
| 16 | 4/30 | Final Exam Due | |