Abstract
Erdős and Hajnal conjectured that, for every graph , there exists a constant such that every graph on vertices which does not contain any induced copy of has a clique or a stable set of size . We prove that for every , there exists such that every graph on vertices not inducing a cycle of length at least nor its complement contains a clique or a stable set of size .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.