2000 character limit reached
The Erdős-Hajnal Conjecture for Paths and Antipaths (1303.5205v3)
Published 21 Mar 2013 in math.CO and cs.DM
Abstract: We prove that for every k, there exists $c_k>0$ such that every graph G on n vertices not inducing a path $P_k$ and its complement contains a clique or a stable set of size $n{c_k}$.
- Nicolas Bousquet (104 papers)
- Aurélie Lagoutte (17 papers)
- Stéphan Thomassé (82 papers)