Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes
classification
🧮 math.CO
keywords
chromaticconsecutiveeverygraphholesinducedlargenumber
read the original abstract
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for every positive integer k, every triangle-free graph with sufficiently large chromatic number contains holes of k consecutive lengths.
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.