Math 565: Combinatorics and Graph Theory
This is an introductory combinatorics class at the graduate level. I plan for the first half of the class to be about graph theory, including topics such as extremal graph theory, Ramsey theory, chromatic numbers and polynomials. For the second half of the class, I plan for us to study geometric combinatorics, including topics such as projective geometries, geometric lattices, matroids, and hyperplane arrangements. However, precise topics are subject to change.
Syllabus
The syllabus is available here.
Important Dates
- Last day to add/drop without “W”: .
- Midterm Exam: (in class).
- Last day to withdraw from course with “W”:
- Take Home Final Exam: Due at 12:30pm.
Office Hours
- Monday’s 1pm–2pm (Math Lab, EH B860)
- Tuesday’s 10am–11am (EH 3827)
- Thursday’s 1pm–2pm (EH 3827)
Textbook
The optional textbook is A Course in Combinatorics by J. H. van Lint and R. M. Wilson, 2nd edition, Cambridge University Press, 2018. UM students can access the book electronically here.
References
- [vLW] A Course in Combinatorics by J. H. van Lint and R. M. Wilson. UM access.
Homework Assignments
- Homework 1 due . Hints.
- Homework 2 due . Hints.
- Homework 3 due . Hints.
- Homework 4 due TBD.
Notes
- A quick introduction to graphs
- Mantel’s theorem and Turan’s theorem
- Ramsey’s theorem
- Van der Waerden’s theorem
- Planar graphs
- Graph colorings
- Hall’s marriage theorem
- Flows in networks and the max-flow min-cut theorem
- Latin squares
List of Lectures
Date | Topics | Additional Reading | Class Notes | Additional Materials |
---|---|---|---|---|
Intro and Mantel’s theorem | [vLW, Chapters 1 and 4] | 1 + pages 1--3 of 2 | ||
Turan’s theorem | [vLW, Chapter 4] + Wiki | rest of 2 (except last page) | ||
Ramsey’s theorem | [vLW, Chapter 3] + Wiki | 3 | ||
Van der Waerden’s theorem | Wiki | 4 | ||
Planar graphs | [vLW, Chapter 33] + Wiki | first 4 pages of 5 | Surfaces from polygons | |
Euler’s formula + graph colorings | [vLW, Chapter 33] | rest of 5 + first 2 pages of 6 | ||
Acyclic orientations + five color theorem | [vLW, Chapter 33] | rest of 6 | ||
Hall’s marriage theorem | [vLW, Chapter 5] | first 4 pages of 7 | ||
HMT continued, Kőnig’s theorem, Birkhoff’s theorem | [vLW, Chapter 5] | pages 5--8 of 7 | ||
Flows and max-flow min-cut theorem | [vLw, Chapter 7] | pages 1--4.3 of 8 | ||
Circulations and Latin squares | [vLW, Chapter 17] | rest of 8, pages 1--3 of 9 | ||
Latin squares (continued) + fire alarm interruption | [vLW, Chapter 17] | pages 3--5 of 9 | ||
Latin squares + Dinitz conjecture | [vLW, Chapter 17] | pages 5--8 of 9 | ||
Midterm (content of notes 1--8 + HWs 1--3) | ||||
Fall break | ||||
Dinitz conjecture continued | [vLW, Chapter 17] | rest of 9 | ||
Finite projective planes | Wiki |
Date published: Tuesday, August 27, 2024