The -edge-coloring equivalence conjecture
Let be a graph with maximum degree , and let an edge-coloring be proper when adjacent edges receive different colors. Two edge-colorings are equivalent if one can be transformed into the other by a sequence of Kempe swaps.
The -edge-coloring equivalence conjecture. All -edge-colorings of a graph are equivalent.
The claim concerns connectivity of the reconfiguration space of edge-colorings under Kempe swaps.
References
Status
- Solved: Carl Feghali, Matthew Johnson, and Daniël Paulusma. Vizing’s conjecture holds (arXiv, 2023) https://arxiv.org/abs/2302.12914
Source: Jonathan Narboni, “Vizing's edge-recoloring conjecture holds”, arXiv:2302.12914 (2023).
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.