Get access

The Erdös–Hajnal Conjecture—A Survey


  • Contract grant sponsor: NSF; Contract grant numbers: DMS-1001091; IIS-1117631.


The Erdös–Hajnal conjecture states that for every graph H, there exists a constant inline image such that every graph G with no induced subgraph isomorphic to H has either a clique or a stable set of size at least inline image. This article is a survey of some of the known results on this conjecture.

Get access to the full text of this article