{
  "id": "2010.15519",
  "version": "v1",
  "published": "2020-10-29T12:26:28.000Z",
  "updated": "2020-10-29T12:26:28.000Z",
  "title": "Spanning trees at the connectivity threshold",
  "authors": [
    "Yahav Alon",
    "Michael Krivelevich",
    "Peleg Michaeli"
  ],
  "comment": "15 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-10-29T12:26:28.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80",
      "05C05"
    ],
    "keywords": [
      "connectivity threshold",
      "spanning trees",
      "explicit connected spanning structure",
      "random graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}