Counting Homomorphisms to Trees Modulo a Prime

DOI10.1145/3460958zbMath1495.68175OpenAlexW4206265020MaRDI QIDQ5868880

J. A. Gregor Lagodzinski, Andreas Göbel, Karen Seidel

Publication date: 24 September 2022

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3460958

zbMATH Keywords

graph homomorphismscomplexity dichotomymodular counting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: Counting Homomorphisms to Trees Modulo a Prime