Combinatorial Analysis

A black and white diagram representing the set partitions and rook placements.

Set partitions and rook placements. (Image by Prof. Postnikov.)

Instructor(s)

MIT Course Number

18.314

As Taught In

Fall 2005

Level

Undergraduate

Cite This Course

Course Features

Course Description

This course analyzes combinatorial problems and methods for their solution. Prior experience with abstraction and proofs is helpful. Topics include: Enumeration, generating functions, recurrence relations, construction of bijections, introduction to graph theory, network algorithms and, extremal combinatorics.

Postnikov, Alexander. 18.314 Combinatorial Analysis, Fall 2005. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/mathematics/18-314-combinatorial-analysis-fall-2005 (Accessed). License: Creative Commons BY-NC-SA


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


Close