The fractional chromatic number of triangle-free subcubic graphs

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

References in corpus (1)

• An upper bound on the fractional chromatic number of triangle-free subcubic graphs