Tree-length is within constant factors of bramble interception radius, Helly-family interception radius, same-vertex-set additive tree distortion, and two new cycle bridging parameters.
Tree approximation in quasi-trees
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree is $(1,C)$-quasi-isometric to a simplicial tree. As a consequence, we show that Gromov's tree approximation lemma for hyperbolic spaces can be improved in the case of quasi-trees to give a uniform approximation for any set of points, independent of cardinality. From this we show that having uniform tree approximation for finite subsets is equivalent to being able to uniformly approximate the entire space by a tree. As another consequence, we note that the boundary of a quasi-tree is isometric to the boundary of its approximating tree under a certain choice of visual metric, and that this gives a natural extension of the standard metric on the boundary of a tree.
citation-role summary
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Graph parameters that are coarsely equivalent to tree-length
Tree-length is within constant factors of bramble interception radius, Helly-family interception radius, same-vertex-set additive tree distortion, and two new cycle bridging parameters.