{
  "id": "1710.08364",
  "version": "v1",
  "published": "2017-10-23T16:17:17.000Z",
  "updated": "2017-10-23T16:17:17.000Z",
  "title": "On the maximum size of connected hypergraphs without a path of given length",
  "authors": [
    "Ervin Győri",
    "Abhishek Methuku",
    "Nika Salia",
    "Casey Tompkins",
    "Máté Vizer"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "In this note we asymptotically determine the maximum number of hyperedges possible in an $r$-uniform, connected $n$-vertex hypergraph without a Berge path of length $k$, as $n$ and $k$ tend to infinity. We show that, unlike in the graph case, the multiplicative constant is smaller with the assumption of connectivity.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-10-23T16:17:17.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "connected hypergraphs",
      "maximum size",
      "graph case",
      "berge path",
      "maximum number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}