ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For graphs GG and HH, write G→HG\to H when there is a graph homomorphism from GG to HH. The promise constraint satisfaction problem PCSP⁡(G,H)\operatorname{PCSP}(G,H) asks whether an input graph maps to GG or does not map to HH.

The PCSP hardness conjecture. PCSP⁡(G,H)\operatorname{PCSP}(G,H) is NP-hard for every non-bipartite loop-less pair of graphs G,HG,H. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.