MATH301 Introduction to Combinatorial Theory, Fall 2007


This course is an introduction to Combinatorics. We discuss essential techniques of counting (including induction and the pigeonhole principle, as well as binomial coefficients). We study discrete objects like graphs, tournaments, permutations and partitions, and algorithms for dealing with them. In particular, we discuss things like graphical partitions, Euler and Hamiltonian paths, minimum spanning tree, shortest paths, all pairs shortest paths, max-flow min-cut, matchings. We introduce Paley graphs and Hamming graphs.

General Information


Weeks 1-5: Chapters 4-8, 15
Weeks 6-10: Chapters 10, 11, 25, 13
Weeks 11-15: Chapters 16, 17, 18


Midterm 1: Wed, 9/19
Midterm 2: Wed, 10/24
Final: during Final's week December 10-14. The exact date can be found on the Registrar's website. It will not be published here.
If you have a conflict, you need to discuss the matter with the teacher well in advance.


Your final grade will be determined from a score of 500. The midterms count 100 each, the homework counts 100, and the final is valued at 200 points. You may receive up to 50 bonus points by doing a project.


hw1 with solutions

hw2 with solutions

hw3 with solutions

hw4 with solutions

hw5 with solutions

hw6 with solutions

hw7 with solutions

File translated from TEX by TTH, version 3.74.
On 18 Oct 2007, 14:58.