On Leighton's graph covering theorem

DOI10.4171/GGD/111zbMath1210.05113arXiv0906.2496OpenAlexW1980829405MaRDI QIDQ531922

Walter D. Neumann

Publication date: 21 April 2011

Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)

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

zbMATH Keywords

graph coveringLeighton's theoremtree lattice

Mathematics Subject Classification ID

Geometric group theory (20F65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Groups acting on trees (20E08)

Related Items (11)

Quasi-isometric classification of non-geometric 3-manifold groups ⋮ Leighton's theorem : extensions, limitations and quasitrees ⋮ Unfoldings and Coverings of Weighted Graphs ⋮ Quasi-isometries between groups with two-ended splittings ⋮ Leighton's theorem and regular cube complexes ⋮ Finite Characterization of the Coarsest Balanced Coloring of a Network ⋮ Revisiting Leighton’s theorem with the Haar measure ⋮ Generalized Baumslag-Solitar groups: rank and finite index subgroups ⋮ Coverings of Configurations, Prime Configurations, and Orbiconfigurations ⋮ Two generalisations of Leighton's theorem (with an appendix by Giles Gardam and Daniel J. Woodhouse) ⋮ Small non-Leighton two-complexes

Cites Work

• Covering theory for graphs of groups
• Finite common coverings of pairs of regular graphs
• Finite common coverings of graphs
• Covering theory for complexes of groups.
• Quasi-isometric classification of non-geometric 3-manifold groups
• Uniform Tree Lattices

This page was built for publication: On Leighton's graph covering theorem