Steiner Tree of Unit Cube
Jump to navigation
Jump to search
Theorem
The length of the Steiner tree for the vertices of the unit cube is given approximately by:
- $L = 6 \cdotp 196 \ldots$
Proof
 | This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Sources
- 1994: Richard Bridges: Minimal Steiner Trees for Three Dimensional Networks (The Mathematical Gazette Vol. 78: pp. 157 – 162) www.jstor.org/stable/3618571
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $6 \cdotp 196 \ldots$