vix.ing · top · new · best · stats · spec

The minimal spanning tree and the upper box dimension

2003/11/30 by Gady Kozma, Zvi Lotker, Gideon Stupp · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Computational Geometry and Mesh Generation #Dimension (graph theory) #Metric (unit) #Metric space #Minimum spanning tree #Space (punctuation) #Spanning tree #Tree (set theory) #Upper and lower bounds #math.CO #math.MG

paper · pdf · doi:10.1090/s0002-9939-05-08061-5

published as Proc. Amer. Math. Soc. 134:4 (2006), 1183--1187

arxiv created 2003/11/30 · openalex publication_date 2005/09/20 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

We show that the α-weight of an MST over n points in a metric space with upper box dimension d has a bound independent of n if α >d and does not have one if α <d.

Cited by