Low-degree minimal spanning trees in normed spaces
Horst Martini, Konrad J Swanepoel
Abstract
We give a complete proof that in any finite-dimensional normed linear space a finite set of points has a minimal spanning tree in which the maximum degree is bounded above by the strict Hadwiger number of the unit ball, i.e., the largest number of unit vectors such that the distance between any two is larger than 1.
Create a lesson
Related papers
The Spherical Hadwiger Theorem
Suijie Wang, Shengguo Wu
Linear isoperimetric filling inequalities in Hadamard spaces at and above the asymptotic rank
Jonas W. Peteranderl
Isometry invariant valuations on spherical polytopes
Jonas Knoerr
The Kernel Deficit Dominates Twice the Hull Deficit: A Sharp Strengthening of Nakano's Inequality
Dakota Charles Baker
In Search of Melchior's Ordinary Points
Jonathan Lenchner, Rik Sengupta
Volume and Projection Inequalities II: Determinants and Lp-Sums
Matthieu Fradelizi, Auttawich Manui, Cheikh Saliou Ndiaye et al.