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

Simple item page
dc.creatorKrön, Bernhard
dc.date2000-10-04
dc.date.accessioned2026-07-07T04:37:50Z
dc.date.available2026-07-07T04:37:50Z
dc.descriptionWe prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of Möller in \cite{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.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/math/0010043
dc.identifierhttp://arxiv.org/abs/math/0010043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60054
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.subject05C75; 05C25; 20B27
dc.titleQuasi-isometries between non-locally-finite graphs and structure trees
dc.typetext

Files

Collections

arXiv