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

2000/10/04 by Bernhard Krön, Krön, Bernhard
Mathematics · #05C25 #05C75 #20B27 #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR) #math.CO #math.GR #msc:05C25 #msc:05C75 #msc:20B27

paper · pdf · doi:10.48550/arxiv.math/0010043

16 pages

arxiv created 2000/10/04 · arxiv updated 2009/11/30

Abstract

We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of Möller in \citemoeller92ends2 for locally finite and transitive graphs are generalized. We also give a criterion which describes quasi-isometry by how edge-ends are split up by the cuts of a structure tree.

Related

• Tree amalgamations and quasi-isometries
• Minor exclusion in quasi-transitive graphs
• Quasi-isometries between graphs with variable edge lengths
• Quasi-transitive K_∞-minor free graphs
• Quasi-treeings are treeable: a streamlined proof