How the proof of the strong perfect graph conjecture was found
Paul D. Seymour · 2006
In 1961, Claude Berge proposed the “strong perfect graph conjecture”, probably the most beautiful open question in graph theory. It was answered just before his death in 2002. This is an overview of the solution, together with an account of some of the ideas that eventually brought us to the answer.