The dichotomy conjecture for directed graph homomorphism problems
Statement
Let be a directed graph. The -colouring problem asks whether an input directed graph admits a homomorphism to .
Dichotomy conjecture. The -colouring problem is polynomial-time solvable or NP-complete.
This conjecture seeks a complete complexity dichotomy for homomorphism problems to fixed directed graphs. The source states that it remains open; no graph-theoretic classification is known.
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.