Distinguishing graphs with intermediate growth
Abstract
A graph G is said to be 2-distinguishable if there is a 2-labeling of its vertices which is not preserved by any nontrivial automorphism of G. We show that every locally finite graph with infinite motion and growth at most O(2((1-) (n)/2)) is 2-distinguishable. Infinite motion means that every automorphism moves infinitely many vertices and growth refers to the cardinality of balls of radius n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.