Notes on Growing a Tree in a Graph

Luc Devroye , Vida Dujmovi\'c , Alan Frieze , Abbas Mehrabian , Pat Morin , Bruce Reed

Authors on Pith no claims yet

classification 🧮 math.PR cs.DMmath.CO

keywords edgegraphtreeaddingendpointexactlygrowingheight

read the original abstract

We study the height of a spanning tree $T$ of a graph $G$ obtained by starting with a single vertex of $G$ and repeatedly selecting, uniformly at random, an edge of $G$ with exactly one endpoint in $T$ and adding this edge to $T$.

This paper has not been read by Pith yet.

Notes on Growing a Tree in a Graph

discussion (0)