The Strong Perfect Graph Theorem VI: A Berge Graph Containing a Long Odd Prism Admits a Proper 2-Join, a Balanced Skew Partition or a Proper Homogeneous PairResearch Paper
A graph is perfect if every induced subgraph has chromatic number equal to its clique number. Berge conjectured in 1961 that a graph is perfect exactly when it contains no odd hole and no odd antihole. Chudnovsky, Robertson, Seymour and Thomas proved this strong perfect graph theorem in 2006 (Ann. of Math. 164 (2006), 51–229). Perfect graphs matter beyond…