Infeasibility of degree-4 Steiner points in optimal BCST for α in (0.5, 1) on the plane
Prove or disprove that, in the branched central spanning tree (BCST) problem with terminals embedded in the Euclidean plane and parameter α in the open interval (0.5, 1), every optimal solution uses Steiner points of degree at most three unless a Steiner point coincides with a terminal (i.e., establish the infeasibility of degree-4 Steiner points under these conditions).
References
Though we have not been able to prove analytically the infeasibility of degree-4 BPs for $\alpha \in ]0.5,1[$, we strongly believe that the statement still holds.
— The Central Spanning Tree Problem
(2404.06447 - Sanmartín et al., 9 Apr 2024) in Section "Geometry of Optimal BCST Topologies", Subsection "Infeasibility of Degree-4 Steiner Points in the Plane"