Full dichotomy conjecture for signed graph s-homomorphisms
Statement
Let be a connected signed graph. An s-core of 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 be the decision problem whose instances are signed graphs and whose question is whether admits an s-homomorphism to .
Full dichotomy conjecture for signed graph s-homomorphisms. Let be a connected signed graph. Then, is polynomial-time solvable if the s-core of 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.