Chao and Yu introduced an entropy method for hypergraph Tur\'an problems, and used it to show that the family of $\lfloor k/2\rfloor$ $k$-uniform tents have Tur\'an density $k!/k^k$. Il'kovi\v{ c} and Yan improved this by reducing to a subfamily of $\lceil k/e\rceil$ tents. In this note, enhancing Il'kovi\v{ c}-Yan's result, we give a significantly shorter entropy proof, with optimal bounds within this framework.
Categories: math.CO