Prof. Igor Pak
This course serves as an introduction to major topics of modern enumerative and algebraic combinatorics with emphasis on partition identities, young tableaux bijections, spanning trees in graphs, and random generation of combinatorial objects. There is some discussion of various applications and connections to other fields.
OCW has published multiple versions of this subject.
Pak, Igor. 18.315 Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics, Spring 2005. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/mathematics/18-315-combinatorial-theory-introduction-to-graph-theory-extremal-and-enumerative-combinatorics-spring-2005 (Accessed). License: Creative Commons BY-NC-SA