Turán Numbers for Forests of Paths in Hypergraphs
Turán Numbers for Forests of Paths in Hypergraphs
The Turán number of an $r$-uniform hypergraph $H$ is the maximum number of edges in any $r$-graph on $n$ vertices which does not contain $H$ as a subgraph. Let $\mathcal{P}_{\ell}^{(r)}$ denote the family of $r$-uniform loose paths on $\ell$ edges, $\mathcal{F}(k,l)$ denote the family of hypergraphs consisting of $k$ disjoint …