Fixed-degree NP-completeness conjecture for non-synchronizing colorings
Statement
Let be a primitive -out graph, meaning a finite directed graph in which every vertex has out-degree and whose associated transition structure is primitive. Let be the set of colorings of , and define
Fixed-degree counting conjecture. The counting problem
is -complete on the class of primitive -out graphs, and remains -complete for fixed out-degree , already for .
This is presented after a proof of the corresponding decision problem and concerns the exact number of non-synchronizing colorings. The source provides no resolution status for this counting claim.
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.