21.228 Discrete Mathematics
This course introduces three of the fundamental areas of
discrete mathematics: enumeration, graph theory and discrete
probability. The introduction to enumeration includes
recurrence relations, generating functions and the
principle of inclusion and exclusion. The introduction
to graph theory includes topics such as paths,
connectivity, Hamilton cycles, planar graphs,
Euler's Theorem, matchings, and trees.
The course also includes an introduction to graph Ramsey theory and, if time permits, a brief introduction to computational complexity.
Course Instructor:
Tom Bohman
Wean Hall 8208
Email: tbohman@math.cmu.edu
Office Hours: Wednesday 3:00-5:00
Teaching Assistants:
Dang Phan
Wean Hall 8207
Email: dtphan@andrew.cmu.edu
Office Hours: Wednesday 1:00-2:00
Cat Raanes
Wean Hall 7110
Email: craanes@andrew.cmu.edu
Office Hours: Thursday 2:00-3:00
Homework 2
Homework 3
Review Sheet for Test 1
Homework 4
Homework 5