Uniform approximation of metrics by graphs
classification
🧮 math.MG
keywords
boundeduniformapproximablegraphgraphsmetricuniformlyapproximation
read the original abstract
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one within a finite Gromov-Hausdorff distance. We show that the Euclidean plane and Gromov hyperbolic geodesic spaces with bounded geometry are approximable by uniform graphs, and pose a number of open problems.
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.