For most graphs H, most H-free graphs have a linear homogeneous set
Erd?s and Hajnal conjectured that for every graph H there is a constant such that every graph G that does not have H as an induced subgraph contains a clique or a stable set of order .
h-free graph homogeneous set erd?s-hajnal