# Perfect Graph

## What is Perfect graph?

In graph theory, a perfect graph is a graph in which the chromatic number of every induced subgraph equals the size of the largest clique of that subgraph (clique number). Equivalently stated in symbolic terms an arbitrary graph is perfect if and only if for all we have . The perfect graphs include many important families of graphs and serve to unify results relating colorings and cliques in those families. For instance, in all perfect graphs, the graph coloring problem, maximum clique problem, and maximum independent set problem can all be solved in polynomial time. In addition, several important min-max theorems in combinatorics, such as Dilworth's theorem, can be expressed in terms of the perfection of certain associated graphs.

### Technology Types

familygraphgraph familyperfect graphsocial group

### Synonyms

Berge graphOdd antiholeOdd hole

### Translations

Graf doskonały (pl)Grafo perfecto (es)Graphe parfait (fr)Perfecte graaf (nl)Perfekter Graph (de)Досконалий граф (uk)Совершенный граф (ru)완벽 그래프 (ko)パーフェクトグラフ (ja)

## Tech Info

Source: [object Object]
— Date merged: 11/6/2021, 1:32:48 PM
— Date scraped: 5/20/2021, 5:38:26 PM