Quasi-isometries between non-locally-finite graphs and structure trees
Abstract
We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in moeller92ends2 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.