Focke, Jacob; Goldberg, Leslie Ann; Živný, Stanislav The complexity of counting surjective homomorphisms and compactions. (English) Zbl 1403.05101 Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 1772-1781 (2018). Cited in 1 Review MSC: 05C60 Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) 05C30 Enumeration in graph theory Keywords:complexity of counting surjective homomorphisms Citations:Zbl 0965.68073; Zbl 1403.05101 PDFBibTeX XMLCite \textit{J. Focke} et al., in: Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7--10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1772--1781 (2018; Zbl 1403.05101) Full Text: arXiv Link