Dvorak-Dell-Grohe-Rattan theorem via an asymptotic argument
By: Alexander Kozachinskiy
Potential Business Impact:
Finds if two pictures are the same.
Two graphs $G_1,G_2$ are distinguished by the Weisfeiler--Leman isomorphism test if and only if there is a tree $T$ that has a different number of homomorphisms to $G_1$ and to $G_2$. There are two known proofs of this fact -- a logical proof by Dvorak and a linear-algebraic proof by Dell, Grohe, and Rattan. We give another simple proof, based on ordering WL-labels and asymptotic arguments.
Similar Papers
Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
Computational Complexity
Helps tell graphs apart using math tricks.
One-sided Hom shifts
Formal Languages and Automata Theory
Lets computers understand patterns in different ways.
Semi-Random Graphs, Robust Asymmetry, and Reconstruction
Discrete Mathematics
Makes computer networks more predictable and secure.