Fractional coloring of triangle-free planar graphs
Combinatorics
2014-02-24 v1
Abstract
We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most 3−n+1/31.
Keywords
Cite
@article{arxiv.1402.5331,
title = {Fractional coloring of triangle-free planar graphs},
author = {Zdeněk Dvořák and Jean-Sébastien Sereni and Jan Volec},
journal= {arXiv preprint arXiv:1402.5331},
year = {2014}
}
Related papers
View all related →
Combinatorics · Mathematics
11/4-colorability of subcubic triangle-free graphs
Zdeněk Dvořák, Bernard Lidický, Luke Postle
2025-03-31
Combinatorics · Mathematics
Subcubic triangle-free graphs have fractional chromatic number at most 14/5
Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec
2017-05-17
Combinatorics · Mathematics
The fractional chromatic number of triangle-free subcubic graphs
David Ferguson, Tomáš Kaiser, Daniel Král'
2013-05-02
Combinatorics · Mathematics
Fractional coloring of planar graphs of girth five
Zdeněk Dvořák, Xiaolan Hu
2018-09-17
Combinatorics · Mathematics
Chromatic number and mimimum degree of K_r-free graphs
Vladimir Nikiforov
2010-01-14
Combinatorics · Mathematics
Sub-exponentially many 3-colorings of triangle-free planar graphs
Arash Asadi, Zdenek Dvorak, Luke Postle, Robin Thomas
2011-03-31
Combinatorics · Mathematics
The Fractional Chromatic Number of Triangle-free Graphs with $\Delta\leq 3$
Linyuan Lu, Xing Peng
2012-07-26
Combinatorics · Mathematics
Triangle-free planar graphs with small independence number
Zdeněk Dvořák, Jordan Venters
2017-02-10
Combinatorics · Mathematics
Planar graphs are 9/2-colorable
Daniel W. Cranston, Landon Rabern
2019-11-18
Combinatorics · Mathematics
An upper bound on the fractional chromatic number of triangle-free subcubic graphs
Chun-Hung Liu
2022-12-06
Combinatorics · Mathematics
3-Colouring Planar Graphs
Vida Dujmović, Pat Morin, Sergey Norin, David R. Wood
2025-07-08
Combinatorics · Mathematics
Triangle-free graphs of tree-width t are ceil((t + 3)/2)-colorable
Zdeněk Dvořák, Ken-ichi Kawarabayashi
2017-06-12
Combinatorics · Mathematics
Do triangle-free planar graphs have exponentially many 3-colorings?
Zdeněk Dvořák, Jean-Sébastien Sereni
2017-09-20
Combinatorics · Mathematics
Some results on chromatic number as a function of triangle count
David G. Harris
2023-10-13
Combinatorics · Mathematics
Triangle-free planar graphs with at most $64^{n^{0.731}}$ 3-colorings
Zdeněk Dvořák, Luke Postle
2021-08-31
Combinatorics · Mathematics
Fractional colorings of cubic graphs with large girth
Frantisek Kardos, Daniel Kral, Jan Volec
2010-10-19
Combinatorics · Mathematics
Fractional chromatic number, maximum degree and girth
François Pirot, Jean-Sébastien Sereni
2021-07-26
Combinatorics · Mathematics
Coloring planar graphs with three colors and no large monochromatic components
Louis Esperet, Gwenaël Joret
2014-06-19
Combinatorics · Mathematics
On triangle-free graphs of order 10 with prescribed 1-defective chromatic number
Nirmala Achuthan, N. R. Achuthan, G. Keady
2015-01-20
Combinatorics · Mathematics
The list chromatic number of graphs with small clique number
Michael Molloy
2018-07-02
Combinatorics · Mathematics
Three coloring via triangle counting
Zachary Hamaker, Vincent Vatter
2022-09-13
Combinatorics · Mathematics
The 3-colorability of planar graphs without cycles of length 4, 6 and 9
Yingli Kang, Ligang Jin, Yingqian Wang
2017-02-27
Combinatorics · Mathematics
On minimal triangle-free planar graphs with prescribed 1-defective chromatic number
Nirmala Achuthan, N. R. Achuthan, G. Keady
2015-01-20
Combinatorics · Mathematics
Fractional triangle decompositions in almost complete graphs
Vytautas Gruslys, Shoham Letzter
2020-08-17
Combinatorics · Mathematics
Triangle-free subgraphs with large fractional chromatic number
Bojan Mohar, Hehui Wu
2023-06-22