The PCSP hardness conjecture for non-bipartite loop-less graphs
Statement
For graphs and , write when there is a graph homomorphism from to . The promise constraint satisfaction problem asks whether an input graph maps to or does not map to .
The PCSP hardness conjecture. is NP-hard for every non-bipartite loop-less pair of graphs . Equivalently, every loop-less graph is left-hard, and every non-bipartite graph is right-hard.
This conjecture would extend Hell and Nešetřil's theorem by asserting NP-hardness for all non-trivial promise graph-colouring problems. Its status is not resolved in the supplied text.
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.