Combinatorial Theory (Math 206B, Winter 2023)

Instructor: Igor Pak
(see email instructions on the bottom of the page).

Class schedule: MWF 3:00 - 3:50 pm, MS 5137

Office Hours: M 4-4:50, MS 6125

Grading: The grade will be based on attendance, class participation (100%).

Difficulty: This is a graduate class in Combinatorics. Students are assumed to be fully familiar with undergraduate Combinatorics and Graph Theory (see Math 180 and Math 184 here). On top of that, I will assume fluency with undergraduate Probability and Linear Algebra.


Much of the course will be dedicated to the study of Enumerative and Asymptotic Combinatorics, as well as some applications. Our main emphasis is on bijective and direct combinatorial proofs.




Websites and collections:


Click here to return to Igor Pak Home Page.

To e-mail me, click here and delete .zzz
Put Math 206B in the Subject line.

Last updated 1/23/2023.