18.314 | Fall 2014 | Undergraduate
Combinatorial Analysis
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.
Learning Resource Types
grading Exams with Solutions
assignment Problem Sets
A spiral graph of embedded polygons from 3-sided to 9-sided.
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.)