Erdős and Hajnal conjectured that, for every graph H, there exists a constant ɛ(H) > 0 such that every H-free graph G (that is, not containing H as an induced subgraph) must contain a clique or an independent set of size at least |G|ɛ(H). We prove that there exists ɛ(H) such that almost every H-free graph G has this property, meaning that, amongst the H-free graphs with n vertices, the proportion having the property tends to one as n → ∞.
CITATION STYLE
Loebl, M., Reed, B., Scott, A., Thomason, A., & Thomassé, S. (2010). Almost all H-free graphs have the Erdös-Hajnal property. In Bolyai Society Mathematical Studies (Vol. 21, pp. 405–414). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-14444-8_11
Mendeley helps you to discover research relevant for your work.