The complexity of approximately counting retractions

Journal article

Let G be a graph that contains an induced subgraph H. A retraction from G to H is a homomorphism from G to H that is the identity function on H. Retractions are very well studied: Given H, the complexity of deciding whether there is a retraction from an input graph G to H is completely classified, in the sense that it is known for which H this problem is tractable (assuming P ≠ NP). Similarly, the complexity of (exactly) counting retractions from G to H is classified (assuming FP ≠ #P). However, almost nothing is known about approximately counting retractions. Our first contribution is to give a complete trichotomy for approximately counting retractions to graphs without short cycles. The result is as follows: (1) Approximately counting retractions to a graph H of girth at least 5 is in FP if every connected component of H is a star, a single looped vertex, or an edge with two loops. (2) Otherwise, if every component is an irreflexive caterpillar or a partially bristled reflexive path, then approximately counting retractions to H is equivalent to approximately counting the independent sets of a bipartite graph—a problem that is complete in the approximate counting complexity class RH Π 1. (3) Finally, if none of these hold, then approximately counting retractions to H is equivalent to approximately counting the satisfying assignments of a Boolean formula. Our second contribution is to locate the retraction counting problem for each H in the complexity landscape of related approximate counting problems. Interestingly, our results are in contrast to the situation in the exact counting context. We show that the problem of approximately counting retractions is separated both from the problem of approximately counting homomorphisms and from the problem of approximately counting list homomorphisms—whereas for exact counting all three of these problems are interreducible. We also show that the number of retractions is at least as hard to approximate as both the number of surjective homomorphisms and the number of compactions. In contrast, exactly counting compactions is the hardest of all of these exact counting problems.

Authors: Focke, J; Goldberg, LA; Živný, S

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Association for Computing Machinery
• Journal: ACM Transactions on Computation Theory
• Volume: 12
• Issue: 3
• Pages: 15:1 - 15:43
• Article number: 15
• Publication date: 2020-06-01
• Acceptance date: 2020-03-01
• DOI: 10.1145/3397472
• EISSN: 1942-3462
• ISSN: 1942-3454
• Language: English
• Keywords: graph homomorphisms; graph compactions; counting complexity; retractions; FFR; surjective homomorphisms; approximate counting