Quasi-isometries between non-locally-finite graphs and structure trees
Combinatorics
2007-05-23 v1 Group Theory
Abstract
We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller 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.
Keywords
Cite
@article{arxiv.math/0010043,
title = {Quasi-isometries between non-locally-finite graphs and structure trees},
author = {Bernhard Krön},
journal= {arXiv preprint arXiv:math/0010043},
year = {2007}
}
Comments
16 pages