Graphs with many r-cliques have large complete r-partite subgraphs
arXiv:math/0703554 · doi:10.1112/blms/bdm093
Abstract
We prove that for all 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 This result implies a concise form of the Erdős-Stone theorem.
Some polishing. Updated references