Perfect graphs appear naturally in a variety of circumstances, such as communication complexity, integrality of polyhedra, polyhedral combinatorics, the channel assignment problem, the geometric algorithms of Grotschel, Lovasz and Schrijver, or semi-definite programming. They are also the source of fundamental mathematical problems.
The course will cover classical topics in perfect graph theory, and will go through selected portions of the recent proof of the Strong Perfect Graph Conjecture, with emphasis on open problems and areas for future research.
Here is a LaTeX template for typesetting the scribe notes. Here are the scribe notes: