Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
classification
🧮 math.CO
keywords
numberchromaticlargeandrascliqueconjectureeverygraph
read the original abstract
We prove a conjecture of Andras Gyarfas, that for all k,t, every graph with clique number at most k and sufficiently large chromatic number has an odd hole of length at least t.
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.