ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (H,Π)(H,\Pi) be a connected signed graph. An s-core of (H,Π)(H,\Pi) is a signed graph obtained by the standard core reduction, equivalently characterized by the property that every s-homomorphism from it to itself is an s-automorphism. Let \textscs−Hom(H,Π)\textsc{s-Hom}(H,\Pi) be the decision problem whose instances are signed graphs (G,Σ)(G,\Sigma) and whose question is whether (G,Σ)(G,\Sigma) admits an s-homomorphism to (H,Π)(H,\Pi).

Full dichotomy conjecture for signed graph s-homomorphisms. Let (H,Π)(H,\Pi) be a connected signed graph. Then, \textscs−Hom(H,Π)\textsc{s-Hom}(H,\Pi) is polynomial-time solvable if the s-core of (H,Π)(H,\Pi) has at most two edges; it is NP-complete otherwise.

The theorem proved in the paper establishes this dichotomy under an additional restriction excluding signed graphs containing all three of a negative digon, a negative loop, and a positive loop. The polynomial-time half is proved for all signed graphs, while the NP-completeness assertion for the remaining cases is the conjectural part.

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.