The tractability conjecture for reducts of finitely bounded homogeneous structures
Statement
Let 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 denote the complete graph on three vertices, and let be the problem of deciding whether a finite input structure admits a homomorphism to .
The tractability conjecture. If does not pp-construct , then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.