{
  "id": "1104.0642",
  "version": "v3",
  "published": "2011-04-04T18:05:25.000Z",
  "updated": "2011-10-21T18:37:28.000Z",
  "title": "Generalizations of the Tree Packing Conjecture",
  "authors": [
    "Dániel Gerbner",
    "Balázs Keszegh",
    "Cory Palmer"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The Gy\\'arf\\'as tree packing conjecture asserts that any set of trees with $2,3, ..., k$ vertices has an (edge-disjoint) packing into the complete graph on $k$ vertices. Gy\\'arf\\'as and Lehel proved that the conjecture holds in some special cases. We address the problem of packing trees into $k$-chromatic graphs. In particular, we prove that if all but three of the trees are stars then they have a packing into any $k$-chromatic graph. We also consider several other generalizations of the conjecture.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2011-10-21T18:37:28.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "generalizations",
      "chromatic graph",
      "gyarfas tree packing conjecture asserts",
      "special cases",
      "complete graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1104.0642G"
    }
  }
}