{
  "id": "1608.04838",
  "version": "v1",
  "published": "2016-08-17T02:37:11.000Z",
  "updated": "2016-08-17T02:37:11.000Z",
  "title": "Almost perfect matchings in $k$-partite $k$-graphs",
  "authors": [
    "Hongliang Lu",
    "Yan Wang",
    "Xingxing Yu"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The minimum co-degree threshold for a perfect matching in a $k$-graph with $n$ vertices was determined by R\\\"odl, Ruci\\'nski and Szemer\\'edi for the case when $n\\equiv 0\\pmod k$. Recently, Han resolved the remaining cases, establishing a conjecture of R\\\"odl, Ruci\\'nski and Szemer\\'edi. In this paper, we determine the minimum co-degree threshold for almost perfect matchings in $k$-partite $k$-graphs, answering a question of R\\\"odl and Ruci\\'nski.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-08-17T02:37:11.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "perfect matching",
      "minimum co-degree threshold",
      "remaining cases",
      "conjecture"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}