ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Gp,qG_{p,q} denote the graph used as the target for (p,q)(p,q)-colourings, and let the textsc{G_{p,q}}-Mixing problem ask whether the reconfiguration graph of (p,q)(p,q)-colourings of an input graph is connected. Circular-colouring mixing complexity conjecture. If

pq=2,\frac{p}{q}=2,

then \textsc{G_{p,q}}-Mixing is in P; if

2<pq<4,2<\frac{p}{q}<4,

then it is co-NP-complete; and if

pq≥4,\frac{p}{q}\geq 4,

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 44.

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.