Perfect graph

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

1 player has it in their collection.

What Wikipedia says

In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every induced subgraph. In all graphs, the chromatic number is greater than or equal to the size of the maximum clique, but they can be far apart.

Excerpt from the Wikipedia article “Perfect graph”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: David Eppstein at English Wikipedia, Public domain, via Wikimedia Commons.