Turán numbers of hypergraph trees

Zoltán Füredi, Tao Jiang

An $r$-graph is an $r$-uniform hypergraph tree (or $r$-tree) if its edges can be ordered as $E_1,\dots ,E_m$ such that $\forall i>1\exists \alpha (i)<i$ such that $E_i\cap (\bigcup_…