Perfect graph theorem

The Perfect Graph Theorem is a result in graph theory that characterizes perfect graphs. A graph is considered *perfect* if, for every induced subgraph, the chromatic number (the smallest number of colors needed to color the graph such that no two adjacent vertices share the same color) equals the size of the largest clique (a subset of vertices, all of which are adjacent to each other).