Xiaona Fang

Any $k$-graph with zero $\ell$-degree Tur\'an density is layered

The codegree Tur\'an density $\pi_{\mathrm{co}}(F)$ is the supremum over all $\gamma \in [0,1)$ such that, for arbitrarily large $n$, there exists an $n$-vertex $F$-free $k$-graph $H$ whose every $(k-1)$-subset of vertices lies in at least $\gamma n$ edges. Ding, Lamaison, Liu, Wang, and Yang (JLMS, 2025) studied the p...