{
  "id": "1304.6901",
  "version": "v3",
  "published": "2013-04-25T13:15:22.000Z",
  "updated": "2013-11-30T20:41:27.000Z",
  "title": "Fractional and integer matchings in uniform hypergraphs",
  "authors": [
    "Daniela Kühn",
    "Deryk Osthus",
    "Timothy Townsend"
  ],
  "comment": "Accepted for publication by the European Journal of Combinatorics",
  "doi": "10.1016/j.ejc.2013.11.006",
  "categories": [
    "math.CO"
  ],
  "abstract": "Our main result improves bounds of Markstrom and Rucinski on the minimum d-degree which forces a perfect matching in a k-uniform hypergraph on n vertices. We also extend bounds of Bollobas, Daykin and Erdos by asymptotically determining the minimum vertex degree which forces a matching of size t < n/2(k-1) in a k-uniform hypergraph on n vertices. Further asymptotically tight results on d-degrees which force large matchings are also obtained. Our approach is to prove fractional versions of the above results and then translate these into integer versions.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2013-11-30T20:41:27.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C65",
      "05C70"
    ],
    "keywords": [
      "uniform hypergraphs",
      "integer matchings",
      "k-uniform hypergraph",
      "force large matchings",
      "minimum vertex degree"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1304.6901K"
    }
  }
}