ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A\mathbf{A} and B\mathbf{B} be non-bipartite loopless undirected graphs such that A→B\mathbf{A}\to\mathbf{B}. The Brakensiek–Guruswami conjecture asserts that

PCSP⁡(A,B)\operatorname{PCSP}(\mathbf{A},\mathbf{B})

is NP⁡\operatorname{NP}-hard. Here PCSP⁡(A,B)\operatorname{PCSP}(\mathbf{A},\mathbf{B}) is the approximate graph homomorphism problem distinguishing instances homomorphic to A\mathbf{A} from instances not homomorphic to B\mathbf{B}. This is presented as a stronger conjecture than the approximate graph-colouring conjecture; the source identifies graphs with loops or bipartite graphs as trivial or reducible to 22-colouring, while the stated non-bipartite loopless case remains open.

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.