Coarse distinguishability of graphs with symmetric growth

DOI10.26493/1855-3974.2354.616zbMath1479.05088arXiv2005.09716OpenAlexW3154163285MaRDI QIDQ5013344

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

Publication date: 30 November 2021

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.09716

zbMATH Keywords

symmetrygrowthgraph coloringcoarsedistinguishing

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Lipschitz and coarse geometry of metric spaces (51F30)

Cites Work

• Unnamed Item
• Unnamed Item
• Coarse differentiation of quasi-isometries. I: Spaces not quasi-isometric to Cayley graphs
• Distinguishing maps
• The distinguishing chromatic number
• Local finiteness, distinguishing numbers, and Tucker's conjecture
• Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
• Horocyclic products of trees
• Topological groups and infinite graphs
• A note on the asymptotic and computational complexity of graph distinguishability
• Generic coarse geometry of leaves
• Symmetry breaking in graphs
• Coarse differentiation of quasi-isometries. II: Rigidity for Sol and lamplighter groups
• Distinguishing density and the distinct spheres condition
• Distinguishing graphs with intermediate growth
• Distinguishing graphs with infinite motion and nonlinear growth
• Asymmetric trees with two prescribed degrees
• On free products of graphs
• A conjecture concerning a limit of non-Cayley graphs
• Random walks on Diestel-Leader graphs

This page was built for publication: Coarse distinguishability of graphs with symmetric growth