Hypergraph extensions of the Erdos Gallai Theorem
We extend the Erdzs Gallai Theorem for Berge paths in r uniform hypergraphs. We also find the extremal hypergraphs avoiding t tight paths of a given length and consider this extremal problem for other definitions of paths in hypergraphs.
Eur. J. Comb.