加载中…
We present an essentially tight bound for the Ramsey-Turán problem for 4-cliques without using the Regularity lemma. This enables us to substantially extend the range in which one has the tight bound for the number of edges in -free graphs as a function of the independence number, apart from lower order terms.

生成讲解博客的中文版本

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