The ErdsHajnal ConjectureA Survey
The ErdsHajnal conjecture states that for every graph H, there exists a constant such that every graph G with no induced subgraph isomorphic to H has either a clique or a stable set of size at least . This article is a survey of some of the known results on this conjecture.
erdshajnal conjecture induced subgraphs