ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and HH be finite graphs, and let SS be a countably infinite graph that is a reduct of a finitely bounded homogeneous structure. Suppose that

G→S→H.G\to S\to H.

A primitive-positive, or pp, construction interprets one relational structure in another using primitive-positive formulas.

Pp-construction conjecture. If PCSP⁡(G,H)\operatorname{PCSP}(G,H) is NP-hard, then K3K_3 has a pp-construction in SS.

This proposes a structural explanation for NP-hardness in the indicated sandwich setting. The paper explicitly leaves the assertion as an open problem; it also notes that, if P differs from NP, the preceding tractability conjecture would imply it.

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.