Complexity classification of counting graph homomorphisms modulo a prime number

by   Andrei A. Bulatov, et al.

Counting graph homomorphisms and its generalizations such as the Counting Constraint Satisfaction Problem (CSP), its variations, and counting problems in general have been intensively studied since the pioneering work of Valiant. While the complexity of exact counting of graph homomorphisms (Dyer and Greenhill, 2000) and the counting CSP (Bulatov, 2013, and Dyer and Richerby, 2013) is well understood, counting modulo some natural number has attracted considerable interest as well. In their 2015 paper Faben and Jerrum suggested a conjecture stating that counting homomorphisms to a fixed graph H modulo a prime number is hard whenever it is hard to count exactly, unless H has automorphisms of certain kind. In this paper we confirm this conjecture. As a part of this investigation we develop techniques that widen the spectrum of reductions available for modular counting and apply to the general CSP rather than being limited to graph homomorphisms.


page 1

page 2

page 3

page 4


Counting Homomorphisms to Trees Modulo a Prime

Many important graph theoretic notions can be encoded as counting graph ...

Counting Homomorphisms Modulo a Prime Number

Counting problems in general and counting graph homomorphisms in particu...

Complexity of Counting Weighted Eulerian Orientations with ARS

Unique prime factorization of integers is taught in every high school. W...

Note on "The Complexity of Counting Surjective Homomorphisms and Compactions"

Focke, Goldberg, and Živný (arXiv 2017) prove a complexity dichotomy for...

On the Robustness of Winners: Counting Briberies in Elections

We study the parameterized complexity of counting variants of Swap- and ...

The Complexity of Approximately Counting Retractions

Let G be a graph that contains an induced subgraph H. A retraction from ...

On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order

We study the problem of counting the number of homomorphisms from an inp...