Erdős–Nešetřil conjecture on the strong chromatic index
Erdős–Nešetřil conjecture on the strong chromatic index
Let be a finite simple graph with maximum degree .
Erdős–Nešetřil conjecture. The strong chromatic index of satisfies
The first non-trivial case, , has been verified, but the conjecture remains open for .
Sources & referencesView supporting material
Primary source
Runze Wang, “Proper edge coloring with rainbow diamonds”, arXiv:2606.06831 (2026).
Additional references
22 papers in this index state this conjecture (2012–2026). The statement above is taken from the most recent of them; the others are arXiv:2606.04856, arXiv:2603.15207, arXiv:2602.03862, arXiv:2509.06808, arXiv:2505.20345, arXiv:2301.12924, arXiv:2205.14680, arXiv:1810.06704, arXiv:1711.03464, arXiv:1508.03515, arXiv:1508.03052, arXiv:1507.08959, and 9 more.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.