Naserasr’s fractional coloring conjecture
For every integer and every planar graph whose odd girth is at least , the fractional chromatic number satisfies .
References
- Weighted odd-cycle transversals and fractional colorings of planar graphs — arXiv — Xiaolan Hu, Jiaao Li, Zhouningxin Wang
Source: arXiv
Progress summary
A 2026 preprint reports a stronger finite-size bound related to Naserasr’s conjecture, but the full conjecture remains open.
Naserasr conjectured that planar graphs with sufficiently large odd girth have fractional chromatic number at most . The conjecture remains unresolved for general planar graphs.
Known results
- Triangle-free planar graphs on vertices satisfy ; this improves the earlier Dvořák–Sereni–Volec bound .
- Jones constructed infinitely many triangle-free planar graphs with , so these values approach .
- For every odd , planar graphs of girth with no cycle lengths from through satisfy the relevant fractional-coloring bound.
October 2026 finite-size strengthening
Xiaolan Hu, Jiaao Li, and Zhouningxin Wang report a strict finite- correction attaining the conjectured bound in the stated planar odd-girth setting, together with a sharper triangle-free planar estimate attained infinitely often. This is a claimed specialist preprint advance, not an independently verified resolution of the full conjecture.
Current status (as of October 2026): Naserasr’s conjecture remains open, while the Hu–Li–Wang preprint claims a quantitative finite-size advance and sharper extremal results in specified planar cases.
Solutions 0
No solutions have been posted yet.