21-701 Discrete Mathematics
This course serves as an introduction to many of the
`classical' questions and theorems of combinatorics.
An emphasis will also be given to the study of the
methods that have proven over time to be most
powerful in solving combinatorial problems. The
subjects most central to the course are ramsey theory
and the probabilistic method. Other topics include
generating functions, extremal grath theory,
correlation inequalities
and set systems.
Course Instructor:
Tom Bohman
Wean Hall 6301
Phone: (412) 268-6881
tbohman@moser.math.cmu.edu
Office Hours: Monday 2:30 - 3:30 or by appointment
A brief syllabus:
Postscript
PDF