Prof. Alexander Postnikov
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