Title of article
The fractional chromatic number of triangle-free graphs with
Author/Authors
Lu، نويسنده , , Linyuan and Peng، نويسنده , , Xing، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
15
From page
3502
To page
3516
Abstract
Let G be a triangle-free graph with maximum degree at most 3. Staton proved that the independence number of G is at least 5 14 | V ( G ) | . Heckman and Thomas conjectured that Staton’s result can be strengthened into a bound on the fractional chromatic number of G , namely χ f ( G ) ≤ 14 5 . Recently, Hatami and Zhu proved that χ f ( G ) ≤ 3 − 3 64 . In this paper, we prove χ f ( G ) ≤ 3 − 3 43 .
Keywords
fractional chromatic number , Fractionally-critical graphs , triangle-free graphs , Gallai forest , Gallai tree
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1600168
Link To Document