The fractional chromatic conjecture for 4-cycle-free planar graphs
Let be a 4-cycle-free planar graph, and let denote its fractional chromatic number. Fractional chromatic conjecture. There exists some such that
The conjecture asks for a uniform improvement over the Four Color Theorem for the fractional chromatic number of 4-cycle-free planar graphs. The supplied text presents it as an open question, and no resolution is given in the status evidence.
References
- Tom Kelly, Sid Kolichala, Caleb McFarland and Jatong Su, “The independence ratio of 4-cycle-free planar graphs”, arXiv:2305.02414 (2026).
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.