2000 character limit reached
The Erdős-Hajnal Conjecture for Paths and Antipaths
Published 21 Mar 2013 in math.CO and cs.DM | (1303.5205v3)
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}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.