Fractional coloring of triangle-free planar graphs

2014/02/21 by Dvořák, Zdeněk, Sereni, Jean-Sébastien, Volec, Jan
#05C72 #Combinatorics (math.CO) #FOS: Mathematics #Primary: 05C15 #Secondary: 05C10

paper · doi:10.48550/arxiv.1402.5331

Abstract

We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most 3-(1)/(n+1/3).

Related

• The Fractional Chromatic Number of Triangle-free Graphs with Δ≤ 3
• The fractional chromatic number of triangle-free subcubic graphs
• Fractional coloring of planar graphs of girth five
• Sub-exponentially many 3-colorings of triangle-free planar graphs
• Triangle-free d-degenerate graphs have small fractional chromatic number