Turán problems for star-path forests in hypergraphs

Junpeng Zhou, Xiying Yuan

An $r$-uniform hypergraph ($r$-graph for short) is linear if any two edges intersect at most one vertex. Let $\mathcal{F}$ be a given family of $r$-graphs. An $r$-graph $H$ is call…