ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple graph. Two kk-edge-colourings are Kempe-equivalent if one can be reached from the other through a series of Kempe changes using colours from {1,…,k}\{1,\ldots,k\}. Mohar's conjecture. All (Δ(G)+2)(\Delta(G)+2)-edge-colourings of GG are Kempe-equivalent. This conjecture would strengthen Vizing's question, which asks whether every edge-colouring using more than the chromatic index can be reduced to an optimal colouring by Kempe changes. Its status is not resolved in the supplied source context.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.