Induced subgraphs of graphs with large chromatic number. III. Long holes
classification
🧮 math.CO
keywords
chromaticinducedlargenumbercompleteconjecturecontainscycle
read the original abstract
We prove a 1985 conjecture of Gy\'arf\'as that for all $k,\ell$, every graph with sufficiently large chromatic number contains either a complete subgraph with $k$ vertices or an induced cycle of length at least $\ell$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.