Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
strong perfect graph conjecture
|
| gptkbp:describes |
characterization of perfect graphs
|
| gptkbp:field |
graph theory
|
| gptkbp:formedBy |
gptkb:Claude_Berge
1961 |
| https://www.w3.org/2000/01/rdf-schema#label |
Berge's conjecture
|
| gptkbp:namedAfter |
gptkb:Claude_Berge
|
| gptkbp:provenBy |
gptkb:Neil_Robertson
gptkb:Paul_Seymour gptkb:Maria_Chudnovsky gptkb:Robin_Thomas |
| gptkbp:relatedTo |
perfect graph
strong perfect graph theorem |
| gptkbp:state |
A graph is perfect if and only if neither the graph nor its complement contains an odd cycle of length at least five as an induced subgraph.
|
| gptkbp:status |
proved
|
| gptkbp:yearProved |
2002
|
| gptkbp:bfsParent |
gptkb:Claude_Berge
|
| gptkbp:bfsLayer |
7
|