ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE

DOI10.1017/fms.2016.30zbMath1358.05236arXiv1409.7587OpenAlexW2963969966MaRDI QIDQ2971040

David Ellis, Itai Benjamini

Publication date: 4 April 2017

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Related Items (4)

On covers of graphs by Cayley graphs ⋮ Local 2-separators ⋮ Local-to-global-rigidity of lattices in \(SL_n(\mathbb{K})\) ⋮ On the structure of random graphs with constant \(r\)-balls

Cites Work

• Unnamed Item
• Automorphisms of random graphs with specified vertices
• Locally cotriangular graphs
• Ramanujan graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Buildings of spherical type and finite BN-pairs
• On graphs with a constant link. II
• Covering spaces of locally homogeneous graphs
• Polygonal complexes and combinatorial group theory
• Covering projections of graphs preserving links of vertices and edges
• Trivalent polygonal complexes of nonpositive curvature and platonic symmetry
• Locally grid graphs: Classification and Tutte uniqueness
• A Construction of Locally Homogeneous Graphs
• A new series of dense graphs of high girth
• The Asymptotic Number of Unlabelled Regular Graphs
• On the asymmetry of random regular graphs and random graphs
• Espaces fibrés en sphères et carrés de Steenrod

This page was built for publication: ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE