The Euclidean MST-ratio for Bi-colored Lattices
Computational Geometry
2024-10-29 v2 Combinatorics
Abstract
Given a finite set, , and a subset, , the \emph{MST-ratio} is the combined length of the minimum spanning trees of and divided by the length of the minimum spanning tree of . The question of the supremum, over all sets , of the maximum, over all subsets , is related to the Steiner ratio, and we prove this sup-max is between and . Restricting ourselves to -dimensional lattices, we prove that the sup-max is , while the inf-max is . By some margin the most difficult of these results is the upper bound for the inf-max, which we prove by showing that the hexagonal lattice cannot have MST-ratio larger than .
Keywords
Cite
@article{arxiv.2403.10204,
title = {The Euclidean MST-ratio for Bi-colored Lattices},
author = {Sebastiano Cultrera di Montesano and Ondřej Draganov and Herbert Edelsbrunner and Morteza Saghafian},
journal= {arXiv preprint arXiv:2403.10204},
year = {2024}
}