An embedded planar graph without isthmuses. In this case the 9-sided face is on the outside and the 7–sided face is completely inside. (Image by Richard Stanley.)
Instructor(s)
Prof. Richard Stanley
MIT Course Number
18.314
As Taught In
Fall 2014
Level
Undergraduate
Course Description
Course Features
Course Description
This course analyzes combinatorial problems and methods for their solution. Topics include: enumeration, generating functions, recurrence relations, construction of bijections, introduction to graph theory, network algorithms, and extremal combinatorics.
