Digraph form of the CSP dichotomy conjecture
Statement
Let be a finite digraph, viewed as a relational structure, and let ask whether a finite input digraph admits a homomorphism to . Digraph CSP dichotomy conjecture. is solvable in polynomial time or NP-complete. Feder and Vardi's reduction makes this restriction equivalent to the general CSP dichotomy conjecture, so resolving it would resolve the fixed-template CSP classification problem.
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.