Fractional coloring of triangle-free planar graphs

Zdeněk Dvořák (1) , Jean-Sébastien Sereni (2) , Jan Volec (3)

1 IUUK - Computer Science Institute of Charles University [Prague]
2 ORPAILLEUR - Knowledge representation, reasonning
3 DIMAP - Centre for Discrete Mathematics and its Applications [Warwick]

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

Mots clés: fractional colouring; planar graph

Domaines: Combinatoire [math.CO]

Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec. Fractional coloring of triangle-free planar graphs. The Electronic Journal of Combinatorics, 2015, 22 (4), pp.#P4.11. ⟨hal-00950493v2⟩