Xiu-Tao Zhu

Tur\'an densities of hypergraph augmentations

For a $t$-graph $F$ and an integer $r\ge t$, the \emph{$r$-augmentation} $F(r)$ is the $r$-graph obtained by adding the same set of $r-t$ new vertices to every edge of $F$. We investigate the behaviour of the \emph{Tur\'an density $\pi(F(r))$}, which is the asymptotically maximum edge density of a large $F(r)$-free $r$...