Strong perfect graph theorem

GPTKB entity

Statements (16)
Predicate Object
gptkbp:instanceOf gptkb:mathematical_concept
gptkbp:field graph theory
gptkbp:generalizes perfect graph theorem
https://www.w3.org/2000/01/rdf-schema#label Strong perfect graph theorem
gptkbp:relatedTo gptkb:Berge_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:statedIn gptkb:Neil_Robertson
gptkb:Paul_Seymour
gptkb:László_Lovász
gptkb:Maria_Chudnovsky
gptkb:Robin_Thomas
gptkbp:yearProved 2002
gptkbp:bfsParent gptkb:Paul_Seymour
gptkbp:bfsLayer 7