Hilton's Overfull Conjecture for dense graphs
Let be a graph with vertex set , maximum degree , chromatic index , and fractional chromatic index . Hilton's Overfull Conjecture. If
then
The conjecture predicts exact rounding of the fractional chromatic index for graphs whose maximum degree exceeds one third of their order. It remains wide open.
References
Primary source
Yan Cao, Guantao Chen, Guangming Jing and Songling Shan, “Proof of the Core Conjecture of Hilton and Zhao”, arXiv:2004.00734 (2020).
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.