Graphs with many r-cliques have large complete r-partite subgraphs

We prove that for all $r\geq2$ and c>0, every graph of order n with at least cn^{r} cliques of order r contains a complete r-partite graph with each part of size $\lfloor c^{r}\log n \rfloor.$ This result implies a concise form of the Erdős-Stone theorem.

No reviews yet.

No comments yet.