Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424190 | European Journal of Combinatorics | 2014 | 37 Pages |
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â2.909.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
David G. Ferguson, TomáÅ¡ Kaiser, Daniel Král',