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

Spring 2005

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

Course Highlights

This course features problems sets in the assignments section, readings, and a complete set of lecture notes.

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.
Donate Now

Staff

Instructor:
Prof. Igor Pak

Course Meeting Times

Lectures:
Three sessions / week
1 hour / session

Level

Graduate