The strong perfect graph theorem

Details The strong perfect graph theorem The strong perfect graph theorem

2002-12-04

arxiv.org/abs/math/0212070v1

Mathematics

Combinatorics

150 pages

Scientific paper

A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least 5 or the complement of one. The "strong perfect graph conjecture" (Berge, 1961) asserts that a graph is perfect if and only if it is Berge. A stronger conjecture was made recently by Conforti, Cornuejols and Vuskovic -- that every Berge graph either falls into one of a few basic classes, or it has a kind of separation that cannot occur in a minimal imperfect graph. In this paper we prove both these conjectures.

Affiliated with

Also associated with

No associations

Rating

The strong perfect graph theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The strong perfect graph theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The strong perfect graph theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-702955