Strong Perfect Graph Theorem
GPTKB entity
Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
SPGT
|
| gptkbp:field |
graph theory
|
| gptkbp:provenBy |
gptkb:Neil_Robertson
gptkb:Paul_Seymour gptkb:Maria_Chudnovsky gptkb:Robin_Thomas |
| gptkbp:publishedIn |
gptkb:Annals_of_Mathematics
|
| gptkbp:relatedTo |
gptkb:Berge_graph
perfect graph odd antihole odd hole |
| gptkbp:state |
A graph is perfect if and only if neither the graph nor its complement contains an induced odd cycle of length at least five.
|
| gptkbp:yearProved |
2002
|
| gptkbp:bfsParent |
gptkb:Vera_Chudnovsky_Chowla
gptkb:Maria_Chudnovsky gptkb:Berge_graph gptkb:Perfect_Graph_Theorem |
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Strong Perfect Graph Theorem
|