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, Eulerian and Hamilton cycles, planar graphs,
Euler's Theorem, matchings, and trees.
Course Instructor:
Tom Bohman
Wean Hall 6301
Phone: (412) 268-6881
Email: tbohman
Office Hours: Thursday 2:00-4:00
Exam week office hours:
Professor Bohman: Thursday, May 8, 1-4.
Michael Young: Friday, May 9, 10-12.