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.
Course Info
Instructor
Departments
Learning Resource Types
grading
Exams with Solutions
assignment
Problem Sets
![A spiral graph of embedded polygons from 3-sided to 9-sided.](/courses/18-314-combinatorial-analysis-fall-2014/34e26b8c8cb14f7c42b18b1384814d01_18-314f14.jpg)
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.)