An -uniform hypergraph has -property if any set of vertices spans a complete sub-hypergraph on vertices. Let be the minimum edge density of an -vertex -uniform hypergraph with {\em -property} and let . A disjoint union of complete hypergraphs has -property, which gives . The first author, Huang and Rödl showed that these constructions are the best asymptotically, that is, . They asked whether it is true for all real number that . In this paper, we give positive answers to this question for a small range of real numbers, and, on the other hand, provide new constructions that give negative answers for many other ranges.

生成讲解博客的中文版本

生成AI智能校验的中文版本