Nika Salia: On the maximum number of hyperedges in connected hypergraphs without long paths.

We determine asymptotically the maximum number of hyperedges possible in an r-uniform
connected hypergraph with no Berge Pk, as n tends to innity. We show that, unlike in the
graph case, the constant becomes smaller with the assumption of connectivity.