The Erd\H{o}s-Hajnal Conjecture for Paths and Antipaths
Combinatorics
2015-06-25 v3 Discrete Mathematics
Abstract
We prove that for every k, there exists such that every graph G on n vertices not inducing a path and its complement contains a clique or a stable set of size .
Keywords
Cite
@article{arxiv.1303.5205,
title = {The Erd\H{o}s-Hajnal Conjecture for Paths and Antipaths},
author = {Nicolas Bousquet and Aurélie Lagoutte and Stéphan Thomassé},
journal= {arXiv preprint arXiv:1303.5205},
year = {2015}
}