Abstract
We prove a 1985 conjecture of Gyárfás that for all , every graph with sufficiently large chromatic number contains either a complete subgraph with vertices or an induced cycle of length at least .
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.