Faben and Jerrum's homomorphism-counting dichotomy conjecture for graphs
Statement
Let be a (not necessarily simple) graph. The involution-free reduction of is the lexicographically minimal involution-free graph such that . The problem asks for the number of graph homomorphisms to , modulo .
Faben and Jerrum's conjecture. The problem is in if the involution-free reduction of 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 -complete.
This conjecture proposes a complexity dichotomy for counting graph homomorphisms modulo 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.