On extremal hypergraphs for forests of tight paths

摘要

In this paper, we investigate the maximal size of a k-uniform hypergraph containing no forests of tight paths, which extends the classical Erdős–Gallai Theorem for paths in graphs. Our results build on the results of Györi, Katona and Lemons, who considered the maximal size of a k-uniform hypergraph containing no single tight path.