Coarse distinguishability of graphs with symmetric growth

Jesús Antonio Álvarez López, Ramón Barral Lijó, Hiraku Nozawa


Let X be a connected, locally finite graph with symmetric growth. We prove that there is a vertex coloring ϕ: X → {0, 1} and some R ∈ ℝ such that every automorphism f preserving ϕ is R-close to the identity map; this can be seen as a coarse geometric version of symmetry breaking. We also prove that the infinite motion conjecture is true for graphs where at least one vertex stabilizer Sx satisfies the following condition: for every non-identity automorphism f ∈ Sx, there is a sequence xn such that lim d(xn, f(xn)) = ∞.


Graph, coloring, distinguishing, coarse, growth, symmetry

Full Text:



ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications