Homomorphism counts to trees

DOI10.46298/DMTCS.13682MaRDI QIDQ7257281zbMATH OpenFDO

Authors Anuj Dawar

Publication date 4 June 2026

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.13682

zbMATH Keywords

bipartite graphsgraph homomorphismstrees

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites work

• Counting bounded tree depth homomorphisms
• Distinguishing graphs by the number of homomorphisms
• Large networks and graph limits
• Logical equivalences, homomorphism indistinguishability, and forbidden minors
• Lov\'asz Meets Weisfeiler and Leman
• On recognizing graphs by numbers of homomorphisms
• Operations with structures
• Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs

This page was built for publication: Homomorphism counts to trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7257281)