The complexity trichotomy for circular-colouring mixing
Statement
Let denote the graph used as the target for -colourings, and let the textsc{G_{p,q}}-Mixing problem ask whether the reconfiguration graph of -colourings of an input graph is connected. Circular-colouring mixing complexity conjecture. If
then \textsc{G_{p,q}}-Mixing is in P; if
then it is co-NP-complete; and if
then it is PSPACE-complete. The first two cases extend known complexity results for odd-cycle mixing and planar inputs, while the full classification remains open, particularly the PSPACE-completeness claim for ratios at least .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.