The Erdös–Hajnal 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.
No takes yet. Share an insight, caveat, or question.
Maria Chudnovsky (2013) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: