Notes on Growing a Tree in a Graph
Probability
2017-07-05 v2 Discrete Mathematics
Combinatorics
Abstract
We study the height of a spanning tree of a graph obtained by starting with a single vertex of and repeatedly selecting, uniformly at random, an edge of with exactly one endpoint in and adding this edge to .
Keywords
Cite
@article{arxiv.1707.00083,
title = {Notes on Growing a Tree in a Graph},
author = {Luc Devroye and Vida Dujmović and Alan Frieze and Abbas Mehrabian and Pat Morin and Bruce Reed},
journal= {arXiv preprint arXiv:1707.00083},
year = {2017}
}
Comments
Updated grant acknowledgement