Subscribe to the OCW Newsletter
-
-
Courses
Find courses by:
Collections
Cross-Disciplinary Topic Lists
Translated Courses
-
About
-
Donate
-
Featured Sites
This is an archived course. A more recent version may be available at ocw.mit.edu.
Set partitions and rook placements. (Image by Prof. Postnikov.)
Prof. Alexander Postnikov
18.314
Fall 2005
Undergraduate
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.
Alexander Postnikov. 18.314 Combinatorial Analysis, Fall 2005. (Massachusetts Institute of Technology: MIT OpenCourseWare), https://ocw.mit.edu (Accessed). License: Creative Commons BY-NC-SA
For more information about using these materials and the Creative Commons license, see our Terms of Use.
MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,200 courses available, OCW is delivering on the promise of open sharing of knowledge.
© 2001–2015
Massachusetts Institute of Technology
Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.
