The Fractional Chromatic Number of Triangle-free Graphs with ≤ 3

Abstract

Let G be any triangle-free graph with maximum degree ≤ 3. Staton proved that the independence number of G is at least 5/14n. 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 f(G) ≤ 3 -3/64. In this paper, we prove f(G) ≤ 3- 3/43$.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…