11/4-colorability of subcubic triangle-free graphs
Combinatorics
2025-03-31 v3
Abstract
We prove that up to two exceptions, every connected subcubic triangle-free graph has fractional chromatic number at most 11/4. This is tight unless further exceptional graphs are excluded, and improves the known bound on the fractional chromatic number of subcubic triangle-free planar graphs.
Keywords
Cite
@article{arxiv.2204.12683,
title = {11/4-colorability of subcubic triangle-free graphs},
author = {Zdeněk Dvořák and Bernard Lidický and Luke Postle},
journal= {arXiv preprint arXiv:2204.12683},
year = {2025}
}
Comments
61 pages, 48 figures, revision and journal style