1.Previous
3.Next

set, a clique represents a chain and a coloring represents a partition into antichains, and induced subgraphs of comparability graphs are themselves comparability graphs, so Mirsky's theorem states that comparability graphs are perfect. Analogously, Dilworth's theorem states that every complement graph of a comparability graph is perfect. The perfect graph theorem of states that the complements of perfect graphs are always perfect, and can be used to deduce

1.Previous
3.Next