Counting Bounded Tree Depth Homomorphisms

DOI10.1145/3373718.3394739zbMath1498.05135arXiv2003.08164OpenAlexW3031354613MaRDI QIDQ5145659

Martin Grohe

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.08164

zbMATH Keywords

first-order logictree depthcounting homomorphismshomomorphism indistinguishability

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Model theory of finite structures (03C13) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Polyadic sets and homomorphism counting ⋮ Discrete density comonads and graph parameters

This page was built for publication: Counting Bounded Tree Depth Homomorphisms