The fractional chromatic number of triangle-free subcubic graphs
Combinatorics
2013-05-02 v3
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).
Keywords
Cite
@article{arxiv.1203.1308,
title = {The fractional chromatic number of triangle-free subcubic graphs},
author = {David Ferguson and Tomáš Kaiser and Daniel Král'},
journal= {arXiv preprint arXiv:1203.1308},
year = {2013}
}