Math 565 Fall 2025
Combinatorics and Graph Theory

This is an introductory combinatorics class at the graduate level. For the first half of the class we will focus on graph theory, including topics such as extremal graph theory, planar graphs, and chromatic polynomials. In the second half of the class, we will study geometric combinatorics. We will focus on projective geometries, matroids, and hyperplane arrangements.

Lectures: Tuesday and Thursday 2:30pm-4:00pm G160 Angell Hall

Instructor: Thomas Lam, tfylam@umich.edu

Office Hours: Tuesday 1:30pm-2:20pm, Thursday 12:30pm-2:20pm in East Hall 2834

Prerequisites:
The most important prerequisite is mathematical maturity. You have to be comfortable with reading and writing proofs. In particular, proofs by contradiction and proofs by induction will be common and used without further explanation. Some experience with abstract algebra, such as group theory or proof-based linear algebra is assumed. Past experience with combinatorics is also helpful.

Grading: There will be problem sets roughly every two weeks. There will be one midterm. There will be no final exam.
Grades will be calculated from: Midterm (25%) and Problem Sets (75%).
If you send me evidence (screenshot) that you have completed the course evaluation, the lowest homework grade will be dropped in the calculation.

Midterm: The midterm will be held on Thursday Oct 9 during class time.

Textbook (Required): A course in combinatorics, J. H. van Lint and R. M. Wilson, 2nd edition.
The textbook is available electronically through the library.
We shall also use An introduction to Hyperplane Arrangements by Richard Stanley.

Homework policy: There will be homework assigned roughly once every two weeks. Homework must be submitted at the start of class. Late homework is not generally accepted. You are allowed to work with other students on the problem sets, but you must include the names of those you worked with when you hand in your homework. You are not allowed to post homework problems on question websites such as mathoverflow or stackexchange. You are not allowed to use solutions generated by AI. If you use a solution you find in a book, online, or elsewhere, you must acknowledge the source. Homework must be submitted in LaTeX. If there is another typesetting software that you prefer, you can send me a sample to ask for permission to use it.
Homework 1 (Due Tuesday September 9. Deadline extended to Friday September 12 midnight.)
Homework 2 (Due Tuesday September 23)
Homework 3 (Due Tuesday October 7)
Homework 4 (Due Tuesday October 28)
Homework 5 (Due Tuesday November 11)
Homework 6 (Due Tuesday November 25)

Academic Misconduct: The University of Michigan community functions best when its members treat one another with honesty, fairness, respect, and trust. The college promotes the assumption of personal responsibility and integrity, and prohibits all forms of academic dishonesty and misconduct. All cases of academic misconduct will be referred to the LSA Office of the Assistant Dean for Undergraduate Education. Being found responsible for academic misconduct will usually result in a grade sanction, in addition to any sanction from the college. For more information, including examples of behaviors that are considered academic misconduct and potential sanctions, please see lsa.umich.edu/lsa/academics/academic-integrity.html.

Disabilities: If you think you need an accommodation for a disability, please let me know as soon as possible. In particular, a Verified Individualized Services and Accommodations (VISA) form must be provided to me at least two weeks prior to the need for a test/quiz accommodation. The Services for Students with Disabilities (SSD) Office (G664 Haven Hall) issues VISA forms.

Tentative plan of lectures:
See also lecture notes for Fall 2024