We show that 33-uniform hypergraphs with the property that all vertices have a quasirandom link graph with density bigger than 1/31/3 contain a clique on five vertices. This result is asymptotically best possible.
生成讲解博客的中文版本
生成AI智能校验的中文版本