We generalize a result of Balister, Gy{\H{o}}ri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an n-vertex, r-uniform, connected, hypergraph with the maximum number of hyperedges, without a k-Berge-path, where n≥Nk,r, k≥2r+13>17.
@article{arxiv.1910.01322,
title = {Connected Hypergraphs without long Berge paths},
author = {Ervin Győri and Nika Salia and Oscar Zamora},
journal= {arXiv preprint arXiv:1910.01322},
year = {2021}
}