Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics

Image of an icosahedron.

Claw covering of the graph of an icosahedron from Problem Set 2. (Image by Prof. Igor Pak.)

Instructor(s)

MIT Course Number

18.315

As Taught In

Spring 2005

Level

Graduate

Cite This Course

Course Description

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.

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


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


Close