{
  "id": "1707.00083",
  "version": "v1",
  "published": "2017-07-01T02:13:26.000Z",
  "updated": "2017-07-01T02:13:26.000Z",
  "title": "Notes on Growing a Tree in a Graph",
  "authors": [
    "Luc Devroye",
    "Vida Dujmović",
    "Alan Frieze",
    "Abbas Mehrabian",
    "Pat Morin",
    "Bruce Reed"
  ],
  "comment": "23 pages, 4 figures",
  "categories": [
    "math.PR",
    "cs.DM",
    "math.CO"
  ],
  "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$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-07-01T02:13:26.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "single vertex",
      "spanning tree"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 23,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}