1 paper
Miklos Bona, Fabian Burghart, Stephan Wagner
We consider the number of common edges in two independent random spanning trees of a graph G. For complete graphs Kn, we give a new proof of the fact, originally obtained by M…