|
| A note on hypergraph extensions ofMantel’s theorem |
| Jie Ma,Tianming Zhu |
| (School of Mathematical Sciences, University of Science and Technology
of China, Hefei, Anhui 230026, China;
Yau Mathematical Sciences Center, Tsinghua University, Beijing 100084,
China) |
| DOI： |
| Abstract: |
| Chao and Yu introduced an entropy method for hypergraph Tur′an
problems, and used it to show that the family of ?k/2? k-uniform tents have
Tur′an density k!/kk
. Il’koviˇc and Yan [5] improved this by reducing to a subfamily of ?k/e? tents. In this note, enhancing Il’koviˇc-Yan’s result, we give a
significantly shorter entropy proof, with optimal bounds within this framework. |
| Key words: Tur´an density, entropy, hypergraph |