Abstract
We consider counting H-colourings from an input graph G to a target graph H. We show that for any fixed graph H without trivial components, this is as hard as the well-known problem \(\#\mathrm {BIS}\), the problem of (approximately) counting independent sets in a bipartite graph. \(\#\mathrm {BIS}\) is a complete problem in an important complexity class for approximate counting, and is believed not to have an FPRAS. If this is so, then our result shows that for every graph H without trivial components, the H-colouring counting problem has no FPRAS. This problem was studied a decade ago by Goldberg, Kelk and Paterson. They were able to show that approximately sampling H-colourings is \(\#\mathrm {BIS}\)-hard, but it was not known how to get the result for approximate counting. Our solution builds on non-constructive ideas using the work of Lovász. The full version is available at arxiv.org/abs/1502.01335. The theorem numbering here matches the full version.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) ERC grant agreement no. 334828. The paper reflects only the authors’ views and not the views of the ERC or the European Commission. The European Union is not liable for any use that may be made of the information contained therein.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dyer, M.E., Goldberg, L.A., Greenhill, C.S., Jerrum, M.: The relative complexity of approximate counting problems. Algorithmica 38(3), 471–500 (2003)
Dyer, M.E., Goldberg, L.A., Jerrum, M.: Counting and sampling \(H\)-colourings. Information and Computation 189(1), 1–16 (2004)
Dyer, M.E., Greenhill, C.: The complexity of counting graph homomorphisms. Random Structures and Algorithms 17(3–4), 260–289 (2000)
Ge, Q., Štefankovič, D.: A graph polynomial for independent sets of bipartite graphs. In: FSTTCS, pp. 240–250 (2010)
Goldberg, L., Jerrum, M.: A counterexample to rapid mixing of the Ge-Štefankovič process. Electron. Commun. Probab. 17(5), 1–6 (2012)
Goldberg, L.A., Kelk, S., Paterson, M.: The complexity of choosing an \(H\)-coloring (Nearly) uniformly at random. SIAM J. Comput. 33(2), 416–432 (2004)
Hell, P., Nešetřil, J.: On the complexity of \(H\)-coloring. Journal of Combinatorial Theory, Series B 48(1), 92–110 (1990)
Jerrum, M.R., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. TCS 43, 169–188 (1986)
Kelk, S.: On the relative complexity of approximately counting H-colourings. Ph.D. Thesis, University of Warwick (2004)
Lovász, L.: Operations with structures. Acta Math. Acad. Sci. Hungar. 18, 321–328 (1967)
Mossel, E., Weitz, D., Wormald, N.: On the hardness of sampling independent sets beyond the tree threshold. Prob. Theory Related. Fields 143, 401–439 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galanis, A., Goldberg, L.A., Jerrum, M. (2015). Approximately Counting H-Colourings is \(\#\mathrm {BIS}\)-Hard. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47672-7_43
Download citation
DOI: https://doi.org/10.1007/978-3-662-47672-7_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47671-0
Online ISBN: 978-3-662-47672-7
eBook Packages: Computer ScienceComputer Science (R0)