Low-degree minimal spanning trees in normed spaces

Simple item page
dc.creatorMartini, Horst
dc.creatorSwanepoel, Konrad J
dc.date2006-03-16
dc.date.accessioned2026-07-07T07:06:58Z
dc.date.available2026-07-07T07:06:58Z
dc.descriptionWe 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.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/math/0603394
dc.identifierhttp://arxiv.org/abs/math/0603394
dc.identifierApplied Mathematics Letters 19 (2006), 122-125
dc.identifierdoi:10.1016/j.aml.2005.03.011
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/110222
dc.subjectMetric Geometry
dc.subjectCombinatorics
dc.subject05C05 (Primary), 52C17 (Secondary)
dc.titleLow-degree minimal spanning trees in normed spaces
dc.typetext

Files

Collections

arXiv