Bonamy–Kardos–Kelly–Postle conjecture on fractional arboricity of planar graphs
Let be a planar graph, and let denote its fractional arboricity: the minimum ratio for which vertices can be assigned at least colors from a total of at most colors, with every color class inducing an acyclic subgraph. Bonamy–Kardos–Kelly–Postle conjecture. Every planar graph satisfies
The paper's abstract states that this conjecture is refuted by a planar signed simple graph whose fractional balanced chromatic number is larger than 2; the construction also yields planar graphs with fractional arboricity exceeding 2.
References
- Reza Naserasr, Lan Anh Pham, Cyril Pujol and Huan Zhou, “Fractional balanced chromatic number and arboricity of planar (signed) graphs”, arXiv:2505.16808 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.