Dichotomy conjecture for digraph homomorphism
Statement
For every fixed digraph , the decision problem that, given an input digraph , asks whether there is a homomorphism from to is either polynomial-time solvable or NP-complete.
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.