The Erdos-Hajnal Conjecture for Paths and Antipaths
Abstract
We prove that for every k, there exists ck>0 such that every graph G on n vertices not inducing a path Pk and its complement contains a clique or a stable set of size nck.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.