ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a minimally rigid graph. Unique NAC-colouring conjecture. We have

NAC⁡#(G)=1\operatorname{NAC}_{\#}(G)=1

if and only if either G∈GscG\in\mathcal{G}_{sc} and it has exactly one 33-prism subgraph, or GG is a 00-extension graph with exactly one open step. The conjecture has been verified by computer for graphs on up to 1010 vertices; the stated graph families are known to satisfy NAC⁡#(G)=1\operatorname{NAC}_{\#}(G)=1, but the converse remains open.

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.