In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0; 1] and a degree constraint b 2. The aim is to nd a minimum weight spanning tree in which each vertex has degree at most b. In this paper we analyze the probabilistic version of the problem and prove in a rmative the conjecture of Yukich stated in 1998 on the asymptotics of the problem for uni...
