Quasi-isometries between non-locally-finite graphs and structure trees
classification
🧮 math.CO
math.GR
keywords
graphsstructurenon-locally-finitequasi-isometrytreescitecriteriacriterion
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.