1 paper
Peleg Michaeli, Asaf Nachmias, Matan Shalev
We show that the diameter of a uniformly drawn spanning tree of a connected graph on n vertices which satisfies certain high-dimensionality conditions typically grows like $Θ(\sq…