{
  "id": "1011.3882",
  "version": "v1",
  "published": "2010-11-17T04:15:36.000Z",
  "updated": "2010-11-17T04:15:36.000Z",
  "title": "Embedding a Forest in a Graph",
  "authors": [
    "Mark Goldberg",
    "Malik Magdon-Ismail"
  ],
  "comment": "Working paper, submitted",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "For \\math{p\\ge 1}, we prove that every forest with \\math{p} trees whose sizes are $a_1,..., a_p$ can be embedded in any graph containing at least $\\sum_{i=1}^p (a_i + 1)$ vertices and having a minimum degree at least $\\sum_{i=1}^p a_i$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-11-17T04:15:36.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "minimum degree"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1011.3882G"
    }
  }
}