The cactus tree of a metric space
We extend the cactus theorem of Dinitz, Karzanov, Lomonosov to metric spaces. In particular we show that if X is a separable continuum which is not separated by n-1 points then the set of all n-tuples of points separating X can be encoded by an R-tree.
Main Authors: | Papasoglu, P, Swenson, E |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2011
|
Similar Items
-
A cactus theorem for end cuts
by: Evangelidou, A, et al.
Published: (2011) -
From continua to R-trees
by: Papasoglu, P, et al.
Published: (2009) -
The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs
by: Dorota Kuziak
Published: (2020-08-01) -
Boundaries and JSJ decompositions of CAT(0)-groups
by: Papasoglu, P, et al.
Published: (2007) -
Cactus
by: Lidón Fabra
Published: (2013-02-01)