{
  "id": "1709.07208",
  "version": "v1",
  "published": "2017-09-21T08:28:09.000Z",
  "updated": "2017-09-21T08:28:09.000Z",
  "title": "The size of $3$-uniform hypergraphs with given matching number and codegree",
  "authors": [
    "Xinmin Hou",
    "Lei Yu",
    "Jun Gao",
    "Boyuan Liu"
  ],
  "comment": "16 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "Determine the size of $r$-graphs with given graph parameters is an interesting problem. Chv\\'atal and Hanson (JCTB, 1976) gave a tight upper bound of the size of 2-graphs with restricted maximum degree and matching number; Khare (DM, 2014) studied the same problem for linear $3$-graphs with restricted matching number and maximum degree. In this paper, we give a tight upper bound of the size of $3$-graphs with bounded codegree and matching number.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-09-21T08:28:09.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "matching number",
      "uniform hypergraphs",
      "tight upper bound",
      "restricted maximum degree",
      "graph parameters"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}