Abstract
We prove a 1985 conjecture of Gyárfás that for all k, ℓ, every graph with sufficiently large chromatic number contains either a clique of cardinality more than k or an induced cycle of length more than ℓ.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
M. Chudnovsky, A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás’ conjectures, J. Combina-torial Theory, Ser. B, to appear, arXiv:1411.6465.
A. Gyárfás: Problems from the world surrounding perfect graphs, Proceedings of the International Conference on Combinatorial Analysis and its Applications, (Pokrzywna, 1985), Zastos. Mat. 19 (1987), 413–441.
A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. I. Odd holes, J. Combinatorial Theory, Ser. B, to appear, arXiv:1410.4118.
A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes, submitted for publication (manuscript January 2015), arXiv:1509.06563.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by NSF grant DMS-1265803.
Supported by ONR grant N00014-14-1-0084 and NSF grant DMS-1265563.
Rights and permissions
About this article
Cite this article
Chudnovsky, M., Scott, A. & Seymour, P. Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes. Combinatorica 37, 1057–1072 (2017). https://doi.org/10.1007/s00493-016-3467-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-016-3467-x