Time and location:
| Date | Topic | References |
|---|---|---|
| 18.2. | Asymptotics of combinatorial bounds (factorial, binomial coefficients, ...). | Invitation 3.4-3.6 |
| 25.2. | Generating functions - definition and simple examples. | Invitation 12.1-12.3, generatingfunctionology 1.1-1.4, 2.2 |
| 4.3. | Generating functions - applications. | generatingfunctionology |
| 11.3. | Network flows (algoritms and duality). | ??? |
| 18.3.. | Matchings in bipartite graphs (Hall's theorem). | ??? |
| 25.3. | Graph connectivity, Menger's theorem. | ??? |
| 1.4. | Finite projective planes. | Invitation 9 |
| 8.4. | Ear decomposition, spanning trees. | Invitation 5.3, 8.1, 8.? |
| 15.4. | Double counting (triangle-free and C4-free graphs, antichains in subset relation, Erdos-Ko-Rado theorem) | Invitation 7 |
| 22.4. | Ramsey theory. | Invitation 11 |
| 29.4. | Applications of Ramsey theory (Erdos-Szekeres theorem, Schur's theorem). | |
| 6.5. | Combinatorial codes (definitions, simple examples, Singleton bound). | Algorithmic Introduction to Coding Theory |
| 13.5. | Combinatorial codes (Hamming bound and code, Gilbert-Varshamov construction). | Algorithmic Introduction to Coding Theory |
| 20.5. | Review. |