The fractional chromatic number of triangle-free subcubic graphs

2012/03/06 by Ferguson, David, Kaiser, Tomáš, Král', Daniel
#05C15 #05C72 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1203.1308

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).

Related

• The Fractional Chromatic Number of Triangle-free Graphs with Δ≤ 3
• The fractional chromatic number of K_Δ-free graphs
• Triangle-free d-degenerate graphs have small fractional chromatic number
• Bounding the fractional chromatic number of K_Δ-free graphs
• Fractional coloring of triangle-free planar graphs