Description

This 10-week course surveys entry-level olympiad combinatorics. Not many theorems are introduced; instead, the course focuses on common strategies or ideas that recur throughout combinatorics. This course is targeted for those getting into olympiad math from computational math and also competitive programmers aiming to improve at so-called "ad-hoc" problems.

Syllabus

1. Invariants and Constructions 1
2. Invariants and Constructions 2
3. Invariants and Constructions 3
4. Equality Cases 1
5. Equality Cases 2
6. Equality Cases 3
7. Pigeonhole and Double Counting 1
8. Pigeonhole and Double Counting 2
9. Graph Theory 1
10. Graph Theory 2