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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.
16 pages

Keywords

Combinatorics, Group Theory, 05C75; 05C25; 20B27

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/60054

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0010043
 http://arxiv.org/abs/math/0010043

Collections

arXiv