Chromatic profiles of odd cycles
arXiv:2409.03407
Abstract
ErdÅs and Simonovits asked the following question: For an integer and a family of non-bipartite graphs , what is the infimum of such that any -free -vertex graph with large enough and minimum degree at least has chromatic number at most ? Denote the infimum as . A fundamental result of ErdÅs, Stone and Simonovits implies that if , then for any , . So the remaining challenge is to determine for . Most previous known results are under the condition that . When , the only known exact results are by Häggkvist and Jin, and for every by Brandt and Thomassé, and by Goddard and Lyle, and Nikiforov. Combining results of Thomassen and Ma, for . In this paper, we determine for all and . We also obtain the following corollary. If is a graph on vertices with , and , then for all . Methods to obtain all previous known results related to odd cycles cannot be applied to solve for for .The innovation of our proof is to give the concept of a `strong -core'. We think that this concept grasps the essence of the problem and it makes our proof concise and elementary (we do not need to borrow any other tools). How to define a proper `core' might be a key to this type of questions.
arXiv admin note: text overlap with arXiv:2408.15487