On the random minimum edge-disjoint spanning trees problem

Abstract

It is well known that finding extremal values and structures can be hard in weighted graphs. However, if the weights are random, this problem can become way easier. In this paper, we examine the minimal weight of a union of $k$ edge-disjoint trees in a complete graph with independent and identically distributed edge weights. The limit of this value (for a given distribution) is known for $k=1,2$. We extend these results and find the limit value for any $k>2$. We also prove a related result regarding the structure of sparse random graphs.