Abstract
We study the problem ⊕HomsToH of counting, modulo 2, the homomorphisms from an input graph to a fixed undirected graph H. A characteristic feature of modular counting is that cancellations make wider classes of instances tractable than is the case for exact (nonmodular) counting; thus, subtle dichotomy theorems can arise. We show the following dichotomy: for any H that contains no 4-cycles, ⊕HomsToH is either in polynomial time or is ⊕P-complete. This partially confirms a conjecture of Faben and Jerrum that was previously only known to hold for trees and for a restricted class of tree-width-2 graphs called cactus graphs. We confirm the conjecture for a rich class of graphs, including graphs of unbounded tree-width. In particular, we focus on square-free graphs, which are graphs without 4-cycles. These graphs arise frequently in combinatorics, for example, in connection with the strong perfect graph theorem and in certain graph algorithms. Previous dichotomy theorems required the graph to be tree-like so that tree-like decompositions could be exploited in the proof. We prove the conjecture for a much richer class of graphs by adopting a much more general approach.
- F. Arends, J. Ouaknine, and C. W. Wampler. 2011. On searching for small Kochen--Specker vector systems. In 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’11), revised papers. Lecture Notes in Computer Science, Vol. 6986. Springer, Berlin, 23--34. DOI:http://dx.doi.org/10.1007/978-3-642-25870-1_4 Google Scholar
Digital Library
- M. A. Armstrong. 1988. Groups and Symmetry. Springer-Verlag, New York, NY.Google Scholar
- A. A. Bulatov and M. Grohe. 2005. The complexity of partition functions. Theoretical Computer Science 348, 2--3, 148--186. Google Scholar
Digital Library
- J.-Y. Cai and P. Lu. 2011. Holographic algorithms: From art to science. Journal of Computer and System Sciences 77, 1, 41--61. Google Scholar
Digital Library
- M. Conforti, G. Cornuéjols, and K. Vušković. 2004. Square-free perfect graphs. Journal of Combinatorial Theory, Series B 90, 2, 257--307. DOI:http://dx.doi.org/10.1016/j.jctb.2003.08.003 Google Scholar
Digital Library
- M. E. Dyer and C. S. Greenhill. 2000. The complexity of counting graph homomorphisms. Random Structures and Algorithms 17, 3--4, 260--289. Google Scholar
Digital Library
- J. Faben and M. Jerrum. 2015. The complexity of parity graph homomorphism: An initial investigation. Theory of Computing 11, 35--57.Google Scholar
Cross Ref
- A. Göbel, L. A. Goldberg, and D. Richerby. 2014. The complexity of counting homomorphisms to cactus graphs modulo 2. ACM Transactions on Computation Theory 6, 4, Article 17. Google Scholar
Digital Library
- L. A. Goldberg, M. Grohe, M. Jerrum, and M. Thurley. 2010. A complexity dichotomy for partition functions with mixed signs. SIAM Journal on Computing 39, 7, 3336--3402. Google Scholar
Digital Library
- L. A. Goldberg, R. Gysel, and J. Lapinskas. 2014. Approximately counting locally-optimal structures. Journal of Computer and System Sciences.Google Scholar
- L. M. Goldschlager and I. Parberry. 1986. On the construction of parallel computers from various bases of Boolean functions. Theoretical Computer Science 43, 43--58. Google Scholar
Digital Library
- H. Guo, S. Huang, P. Lu, and M. Xia. 2011. The complexity of weighted Boolean #CSP modulo k. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS’11), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 9. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 249--260. DOI:http://dx.doi.org/10.4230/LIPIcs.STACS.2011.249Google Scholar
- P. Hell and J. Nešetřil. 1990. On the complexity of H-coloring. Journal of Combinatorial Theory, Series B 48, 1, 92--110. Google Scholar
Digital Library
- P. Hell and J. Nešetřil. 2004. Graphs and Homomorphisms. Oxford University Press, New York, NY.Google Scholar
- L. Lovász. 1967. Operations with structures. Acta Mathematica Academiae Scientiarum Hungaricae 18, 3--4, 321--328.Google Scholar
Cross Ref
- C. H. Papadimitriou and S. Zachos. 1982. Two remarks on the power of counting. In Proceedings of the 6th GI-Conference on Theoretical Computer Science. Springer-Verlag, 269--275. Google Scholar
Digital Library
- T. J. Schaefer. 1978. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC’78). ACM Press, 216--226. Google Scholar
Digital Library
- S. Toda. 1991. PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing 20, 5, 865--877. Google Scholar
Digital Library
- L. G. Valiant. 2006. Accidental algorithms. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS’06). IEEE, 509--517. Google Scholar
Digital Library
- M. Xia, P. Zhang, and W. Zhao. 2007. Computational complexity of counting problems on 3-regular planar graphs. Theoretical Computer Science 384, 1, 111--125.Google Scholar
Cross Ref
Index Terms
Counting Homomorphisms to Square-Free Graphs, Modulo 2
Recommendations
On counting homomorphisms to directed acyclic graphs
It is known that if P and NP are different then there is an infinite hierarchy of different complexity classes that lie strictly between them. Thus, if P ≠ NP, it is not possible to classify NP using any finite collection of complexity classes. This ...
The complexity of counting homomorphisms to cactus graphs modulo 2
A homomorphism from a graph G to a graph H is a function from V(G) to V(H) that preserves edges. Many combinatorial structures that arise in mathematics and in computer science can be represented naturally as graph homomorphisms and as weighted sums of ...
Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
We study the problem of computing the parity of the number of homomorphisms from an input graph $G$ to a fixed graph $H$. Faben and Jerrum [Theory Comput., 11 (2015), pp. 35--57] introduced an explicit criterion on the graph $H$ and conjectured that, if ...






Comments