ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a (not necessarily simple) graph. The involution-free reduction of HH is the lexicographically minimal involution-free graph H′H' such that H→∗H′H\rightarrow^* H'. The problem ⊕HomsTo⁡(H)\oplus \operatorname{HomsTo}(H) asks for the number of graph homomorphisms to HH, modulo 22.

Faben and Jerrum's conjecture. The problem ⊕HomsTo⁡(H)\oplus \operatorname{HomsTo}(H) is in FP\mathrm{FP} if the involution-free reduction of HH is the empty graph, a singleton vertex with or without a self-loop, or a graph with two isolated vertices, exactly one of which has a self-loop. Otherwise, it is ⊕P\oplus\mathrm{P}-complete.

This conjecture proposes a complexity dichotomy for counting graph homomorphisms modulo 22 on arbitrary graphs, extending the known dichotomy for trees. The supplied text does not state whether the conjecture has been resolved.

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.