| Week | Lecture dates | Sections | topics |
|---|---|---|---|
| 1 | 9/3, 9/6 (TF) | 1.1-1.4 | Definitions, Paths, distance and Examples |
| 2 | 9/10, 9/13 | 2.1-2.5, 3.1-3.2 | Degree, Degree Sequence, Isomorphism |
| 3 | 9/17, 9/20 | 4.1-4.4 | Trees and bridges |
| 4 | 9/24, 9/27 | 5.1-5.4 | Connectivity |
| 5 | 10/1, 10/4 | 6.1-6.3 | Eulerian and Hamiltonian graphs |
| 6 | 10/8, 10/11 | 7.1-7.3 | Digraphs and tournaments |
| 6 | 10/15, 10/18 | Ch. 1-7 | Review, Midterm |
| 7 | 10/22, 10/25 | 8.1-8.5 | Factorization and Matchings, Marriage Theorem |
| 8 | 10/29, 11/1 | 9.1-9.4 | Planar graphs, torus graphs |
| 9 | 11/5, 11/8 | 10.1-10.4 | Coloring graphs |
| 10 | 11/12, 11/15 | 11.1-11.2 | Ramsey Numbers |
| 11 | 11/19, 11/22 | Chapters 8-11 | Review, Midterm |
| 12 | 11/27 (W) | Chromatic polynomials | No class Tues, Thanksgiving week |
| 13 | 12/3, 12/6 | 12.1-12.3 | Distance |
| 14 | 12/10 | 13.1-13.5 | Review |
| XX | 12/17 (Tues) | Final Exam (8-11 AM) | |
| Due date | Homework Section/Problems |
|---|---|
| 9/13/24 | Chapter 1: #1.4, 1.10; 1.12(a-e); 1.24, 1.30
Chapter 2: #2.1, 2.4, 2.8, 2.14 |
| 9/20/24 | Chapters 2,3,4: #2.20,2.24 2.32, 3.3, 3.17, 4.2, 4.3 | 9/27/24 | Chapter 4: #4.9, 4.12, 4.14, 4.18, 4.27, 4.28, 5.3 | 10/4/24 | Chapter 5: #5.6, 5.7, 5.9; 6.5, 6.6, 6.10, 6.13(a,b) | 10/11/24 |
Chapter 6: #6.15, 6.18, 6.24a, Chapter 7: #7.2, 7.3, 7.7, 7.10 |
10/25/24 | Chapter 8: #8.1, 8.2, 8.3, 8.5, 8.6(b), 8.17, 8.18 | 11/1/24 | Chapter 9: #9.1, 9.2, 9.4, 9.5, 9.8, 9.9, 9.10 | 11/8/24 |
Chapter 9: #9.23, 9.26, 9.27(a,d) Chapter 10: #10.1, 10.2(a), 10.4(a,b), 10.10 |
11/15/24 |
Chapter 10: #10.17, 10.18, 10.19 Chapter 11: #11.1, 11.4, 11.6 |
12/8/24 |
Three problems from
notes for chromatic polynomials, and Chapter 12: #12.3, 12.8, 12.10, 12.12 |
Syllabus in Catalogue: Colorability, connectedness, tournaments, eulerian and hamiltonian paths, orientability, and other topics from the theory of finite linear graphs, with an emphasis on applications chosen from social, biological, computer science, and physical problems.
Charles Weibel / Fall 2024