ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A{\mathbb A} be a reduct of a finitely bounded homogeneous structure: it is obtained by forgetting some relations from a homogeneous structure, and the ambient structure is characterized among finite structures by forbidding embeddings of a finite set of finite structures. Let K3{\mathbb K}_3 denote the complete graph on three vertices, and let CSP⁡(A)\operatorname{CSP}({\mathbb A}) be the problem of deciding whether a finite input structure admits a homomorphism to A{\mathbb A}.

The tractability conjecture. If A{\mathbb A} does not pp-construct K3{\mathbb K}_3, then CSP⁡(A)\operatorname{CSP}({\mathbb A}) is polynomial-time solvable.

This is described as a wide-open generalization of the Feder–Vardi conjecture to reducts of finitely bounded homogeneous structures and is the subject of an active research program.

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.