Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths

Radu Curticapean, Holger Dell, Thore Husfeldt

We systematically investigate the complexity of counting subgraph patterns modulo fixed integers. For example, it is known that the parity of the number of $k$-matchings can be det…