Fetching the paper…
Reading the bibliography…
Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$ denotes the number of homomorphisms from $F$ to $G$.
Operations with structures
László Lovász · 1967
Earlier work this paper cites.
An optimal lower bound on the number of variables for graph identification
Jin-yi Cai, Martin Fürer, and Neil Immerman · 1992
Earlier work this paper cites.
Graph searching and a min-max theorem for tree-width
Paul D. Seymour and Robin Thomas · 1993
Earlier work this paper cites.
The power of counting logics on restricted classes of finite structures
Anuj Dawar and David Richerby · 2007
Earlier work this paper cites.
On recognizing graphs by numbers of homomorphisms
Zdenek Dvorák · 2010
Earlier work this paper cites.
Weisfeiler-Lehman graph kernels
Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, and Karsten M. Borgwardt · 2011
Earlier work this paper cites.
Homomorphisms are a good basis for counting small subgraphs
Radu Curticapean, Holger Dell, and Dániel Marx · 2017
Cited alongside, same era.
On the combinatorial power of the Weisfeiler-Lehman algorithm
Martin Fürer · 2017
Cited alongside, same era.
Lovász meets Weisfeiler and Leman
Holger Dell, Martin Grohe, and Gaurav Rattan · 2018
Cited alongside, same era.
Weisfeiler and Leman go neural: Higher-order graph neural networks
Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe · 2019
Cited alongside, same era.
How powerful are graph neural networks?
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka · 2019
Cited alongside, same era.
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, and Oleg Verbitsky · 2020
Cited alongside, same era.
Counting bounded tree depth homomorphisms
Martin Grohe · 2020
Later among the works it cites.
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
Laura Mancinska and David E. Roberson · 2020
Later among the works it cites.
Weisfeiler and Leman go machine learning: The story so far
Christopher Morris, Yaron Lipman, Haggai Maron, Bastian Rieck, Nils M. Kriege, Martin Grohe, Matthias Fey, and Karsten M. Borgwardt · 2021
Later among the works it cites.
Homomorphism tensors and linear equations
Martin Grohe, Gaurav Rattan, and Tim Seppelt · 2022
Later among the works it cites.
Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree
David E. Roberson · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tim Seppelt · 2023
Closest in time.