The Steiner subratio conjecture for the Euclidean plane
The Steiner subratio conjecture for the Euclidean plane
Let denote the Steiner subratio of the Euclidean plane, defined as the infimum of the ratios of minimal-filling weight to Steiner minimal-tree length over all nontrivial finite subsets. Steiner subratio conjecture. The infimum is attained at the vertex set of a regular triangle and
The source records the exact values for three- and four-point subsets and proposes that the global Steiner subratio has the same value, but gives no resolution of the conjecture.
Sources & referencesView supporting material
Primary source
A. O. Ivanov and A. A. Tuzhilin, “Optimal Networks”, arXiv:1210.6228 (2012).
Additional references
2 papers in this index state this conjecture (2011–2012). The statement above is taken from the most recent of them; the others are arXiv:1101.0106.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.