Almost All F-Free Graphs Have The Erdos-Hajnal Property - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Book Sections Year : 2010

Almost All F-Free Graphs Have The Erdos-Hajnal Property

Abstract

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-ïvee graph G has this property, meaning that, amongst the if-free graphs with n vertices, the proportion having the property tends to one as n → ∞.

Dates and versions

lirmm-00806800 , version 1 (02-04-2013)

Identifiers

Cite

Martin Loebl, Bruce Reed, Alex Scott, Andrew Thomason, Stéphan Thomassé. Almost All F-Free Graphs Have The Erdos-Hajnal Property. An Irregular Mind, 21, pp.405-414, 2010, ⟨10.1007/978-3-642-14444-8_11⟩. ⟨lirmm-00806800⟩
254 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More