Steiner tree!
Source: IMAR Test 2014 Problem 4
May 14, 2015
combinatoricsSteiner Trees
Problem Statement
Let be a positive integer. A Steiner tree associated with a finite set of points in the Euclidean -space is a finite collection of straight-line segments in that space such that any two points in are joined by a unique path in , and its length is the sum of the segment lengths. Show that there exists a Steiner tree of length associated with the vertex set of a unit -cube.