Erdős–Nešetřil strong edge-colouring conjecture
This entry tracks Erdős–Nešetřil strong edge-colouring conjecture.
It verifies a sharp structured case of a major strong edge-colouring conjecture.
Latest development
The bound χ′ₛ(G)≤28 is proved for loopless multigraphs of Ore-degree at most nine, yielding the stated simple-graph case.
Editorial caveat
The general conjectured bound remains open.
References
- Strong chromatic index of graphs with Ore-degree at most nine — arXiv — Xiaoxue Hu, Jiangxu Kong, Yu Xue
Source: arXiv
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.