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 ℓ.
Cite
CITATION STYLE
APA
Chudnovsky, M., Scott, A., & Seymour, P. (2017). Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes. Combinatorica, 37(6), 1057–1072. https://doi.org/10.1007/s00493-016-3467-x
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free