On Numbers of Simplicial Walks and Equivalent Canonizations for Graph Recognition

Marek Černý

Two graphs are isomorphic exactly when they admit the same number of homomorphisms from every graph. Hence, a graph is recognized up to isomorphism by homomorphism counts over the…