Exact Gromov-Hausdorff distances are derived between arbitrary simplexes and 2-distance spaces, yielding a complete solution to the generalized Borsuk problem and expressions for graph clique cover and chromatic numbers.
The Gromov-Hausdorff Distances between Simplexes and Ultrametric Spaces
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In the present paper we investigate the Gromov--Hausdorff distances between a bounded metric space $X$ and so called simplex, i.e., a metric space all whose non-zero distances are the same. In the case when the simplex's cardinality does not exceed the cardinality of $X$, a new formula for this distance is obtained. The latter permits to derive an exact formula for the distance between a simplex and an ultrametric space.
fields
math.MG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Gromov--Hausdorff Distance between Simplexes and Two-Distance Spaces
Exact Gromov-Hausdorff distances are derived between arbitrary simplexes and 2-distance spaces, yielding a complete solution to the generalized Borsuk problem and expressions for graph clique cover and chromatic numbers.