ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A relational structure TT is a structure consisting of a domain together with relations of prescribed names and arities. For a fixed relational structure TT, \textscCsp(T)\textsc{Csp}(T) is the decision problem whose instances are relational structures SS over the same vocabulary as TT, with question whether there is a homomorphism S→TS\to T.

Feder–Vardi dichotomy conjecture. For any relational structure TT, \textscCsp(T)\textsc{Csp}(T) is either NP-complete or polynomial-time solvable.

This is a major open problem in computational complexity. It is known for graph homomorphisms with one symmetric binary relation by the Hell–Nešetřil dichotomy theorem, and Feder and Vardi showed that a dichotomy for bipartite digraph homomorphism problems would imply the conjecture.

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.