The fractional chromatic number of triangle-free subcubic graphs
classification
🧮 math.CO
keywords
chromaticfractionalnumbersubcubictriangle-freegraphconjecturedestimates
read the original abstract
Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14/5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free subcubic graph is at most 32/11 (which is roughly 2.909).
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.