Quasi-isometries between non-locally-finite graphs and structure trees

DOI10.1007/BF02941469zbMath0992.05067arXivmath/0010043OpenAlexW1994893083MaRDI QIDQ5956171

Bernhard Krön

Publication date: 11 September 2002

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

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

zbMATH Keywords

endsnon-locally-finite graphsstructure trees

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Infinite automorphism groups (20B27)

Related Items (6)

Vertex Cuts ⋮ A descriptive construction of trees and Stallings’ theorem ⋮ Quasi-isometries between graphs and trees ⋮ Analogues of Cayley graphs for topological groups ⋮ End-transitive graphs ⋮ Cutting up graphs revisited – a short proof of Stallings' structure theorem

Cites Work

• Vertex-transitive graphs and accessibility
• Cutting up graphs
• Martin and End Compactifications for Nonlocally Finite Graphs
• Accessibility and Groups of Cohomological Dimension One
• Ends of graphs
• Ends of graphs. II
• Graphen ohne unendliche Wege
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quasi-isometries between non-locally-finite graphs and structure trees