Turan numbers of extensions of some sparse hypergraphs via Lagrangians

Tao Jiang, Yuejian Peng, Biao Wu

Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ ver…