The Strong Perfect Graph Theorem, proved by Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas in 2006, establishes an important characterization of perfect graphs. The theorem states that a graph is perfect if and only if it contains no induced subgraph that is an odd cycle of length at least 5 or the complement of such a cycle (i.e., a complete graph minus an odd cycle).

Ancestors (6)

  1. Theorems in graph theory
  2. Theorems in discrete mathematics
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version