MathDB
Steiner tree!

Source: IMAR Test 2014 Problem 4

May 14, 2015
combinatoricsSteiner Trees

Problem Statement

Let nn be a positive integer. A Steiner tree associated with a finite set SS of points in the Euclidean nn-space is a finite collection TT of straight-line segments in that space such that any two points in SS are joined by a unique path in TT , and its length is the sum of the segment lengths. Show that there exists a Steiner tree of length 1+(2n11)31+(2^{n-1}-1)\sqrt{3} associated with the vertex set of a unit nn-cube.