Combinatorial Analysis

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.)


MIT Course Number


As Taught In

Fall 2014



Cite This Course

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.

Other Versions

Other OCW Versions

Archived versions: Question_avt logo

Related Content

Richard Stanley. 18.314 Combinatorial Analysis. Fall 2014. Massachusetts Institute of Technology: MIT OpenCourseWare, License: Creative Commons BY-NC-SA.

For more information about using these materials and the Creative Commons license, see our Terms of Use.