,
Sushovan Majhi
,
Fedor Manin
,
Žiga Virk
,
Nicolò Zava
Creative Commons Attribution 4.0 International license
Let G be a finite, connected metric graph and let X be a subset of G. If X is sufficiently dense in G, we show that the Gromov-Hausdorff distance matches the Hausdorff distance, namely d_GH(G,X) = d_H(G,X). When the metric graph is the circle G = S¹ with circumference 2π, a recent study established the equality d_GH(S¹,X) = d_H(S¹,X) whenever d_GH(S¹,X) < π/6. Our results relax this hypothesis to d_GH(S¹,X) < π/3, and furthermore, we show that the constant π/3 is the best possible. We lower bound the Gromov-Hausdorff distance d_GH(G,X) by the Hausdorff distance d_H(G,X) via a simple topological obstruction: the existence of a possibly discontinuous function f: G → X with too small distortion contradicts the connectedness of G.
@InProceedings{adams_et_al:LIPIcs.SoCG.2026.3,
author = {Adams, Henry and Majhi, Sushovan and Manin, Fedor and Virk, \v{Z}iga and Zava, Nicol\`{o}},
title = {{Lower Bounding the Gromov-Hausdorff Distance in Metric Graphs}},
booktitle = {42nd International Symposium on Computational Geometry (SoCG 2026)},
pages = {3:1--3:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-418-5},
ISSN = {1868-8969},
year = {2026},
volume = {367},
editor = {Ahn, Hee-Kap and Hoffmann, Michael and Nayyeri, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.3},
URN = {urn:nbn:de:0030-drops-258099},
doi = {10.4230/LIPIcs.SoCG.2026.3},
annote = {Keywords: Gromov-Hausdorff distance, distortion, connectedness, Borsuk-Ulam theorem}
}