##
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 6113
Phone: (412) 268-2550
Email: tbohman
Office Hours: Wednesday 2:30-4:00

##
Teaching Assistant:

Jing Zhang
Wean Hall 6213
Phone: (412) 268-6828
Email: jingzhan
Office Hours: Thursday 3:00-5:00

### Exam period office hours.

#### Prof. Bohman: Thursday, May 10 12:30-2:30

Jing Zhang: Thursday, May 10 3:00-5:00

## Announcement.

###
Students may opt-out of the final
exam by electing the alternate grading scheme, which is
based entirely on the average of the three test
scores. This was announced in class on Friday, May 4.
Contact Professor Bohman for details.

Homework 2:
Postscript
PDF

Homework 3:
Postscript
PDF

Review Sheet for Test 1:
Postscript
PDF

Homework 4:
Postscript
PDF

Homework 5:
Postscript
PDF

Homework 6:
Postscript
PDF

Review Sheet for Test 2:
Postscript
PDF

Homework 7:
Postscript
PDF

Homework 8:
Postscript
PDF

Homework 9:
Postscript
PDF

Review Sheet for Test 3:
Postscript
PDF

Review Sheet for the Final Exam:
Postscript
PDF