Math 2.0

Areas Graph theory Topic

Perfect graphs and intersection graphs

Summary

This topic is a part of graph theory. It covers graphs in which the chromatic number equals the clique number on every induced subgraph, the perfect graph theorems, the intersection graph classes that are perfect or close to perfect, and the Lovász theta function.

About this page
Tag5MS2H43979
URIm2://5MS2H43979
Kindtopic
WritingW0 stub
MSC05C17, 05C62
Part ofGraph theory
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.