| Tuesday |
Thursday |
| Sep 8: Introduction and Preliminaries |
|
| Sep 13: Counting questions, product rule, sum rule | Sep 15: Permutations and combinations |
| Sep 20: Permutations and combinations; repetitions |
Sep 22: Pigeon-hole principle; bijection rule
|
| Sep 27: Inclusion-exclusion and overview of basic enumeration |
Sep 29: Review of induction |
| Oct 4: Recursion |
Oct 6: Generating functions and solving recursion |
| Oct 11: Generating functions and solving recursion | Oct 13: Generating functions and solving recursion |
| Oct 18: Generating functions and solving recursion; review | Oct 20: Midterm Exam |
| Oct 25: Review of exam concepts; Graph theory basics | Oct 27: Induction on graphs; digraphs; connectedness |
| Nov 1: Paths and circuits; trees | Nov 3: Eulerian paths and circuits |
| Nov 8: Hamiltonian paths and circuits | Nov 10: Colouring graphs |
| Nov 15: Colouring graphs | Nov 17: Bipartite graphs; review of graph theory |
| Nov 22: Constructing designs | Nov 24: Latin squares |
| Nov 29: Fisher's inequality; Steiner systems; Kirkman systems | Dec 1: Steiner systems; Kirkman systems |
| Dec 6: Designs and codes | Dec 8: Catch-up and review |
|
Final Exam:
2pm on Thurs, Dec 15
|