Intensive Training for 2022 Myanmar IMO Team (Combinatorics)
The name is self-explanatory. The content is just common problem solving techniques in olymmpiad combinatoircs such as the use of invariants, repeat-until-stuck algorithms, double counting and basic graph theory.
Lecture Videos and Slides
- Lecture 1 - Monovariants: slides pdf, video link
- Lecture 2 - Invariants: slides pdf, video link
- Lecture 3 - Parity: slides pdf, video link
- Lecture 4 - Induction: slides pdf, video link
- Lecture 5 - Greedy Algorithms and Repeat-Until-Stuck: slides pdf, video link
- Lecture 6 - Double Counting: slides pdf, video link
- Lecture 7 - Polyhedron Formula : slides pdf, video link
- Lecture 8 - Counting in Graphs: slides pdf, video link
- Lecture 9 - Injections and Bijections: slides pdf, video link
- Lecture 10 - Pigeonhole Principle: slides pdf, video link
- Lecture 11 - Discrete Continuity and Infinite Descent: slides pdf, video link
- Lecture 12 - Colorings and WLOG: slides pdf, video link
- Lecture 13 - Combinatorial Games: slides pdf, video link
- Lecture 14 - Solutions to Mock Test and Problem Solving Philosophy: slides pdf, video not available
Problem Sets
- Problem Set 1: pdf, solutions
- Problem Set 2: pdf, solutions
- Problem Set 3: pdf, solutions
- Problem Set 4: pdf
- Problem Set 5: pdf, solutions
- Problem Set 6: pdf
- Problem Set 7: pdf