Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem (Q1850610): Difference between revisions

A conjecture of Bollobás and Kohayakawa that generalizes the extremal result of Erdős and Stone is verified. In particular, using Szemerédi's regularity lemma, it is proved that there is an absolute constant \(\beta > 0\) such that for all \(r \geq 1\), \(0 < \gamma < 1\), and \(0 < c < 1/r\), every graph \(G\) of sufficiently large order \(n\) with at least \((1 - 1/r + c){n \choose 2}\) edges contains the complete \((r+1)\)-partite graph \(K_{r+1}(s_0, m_0, \dots, m_0, \ell_0)\), where \[ s_0 = \left\lfloor (1 - \gamma)\beta \frac{\log n}{\log(1/c)} \right\rfloor, \quad m_0 = \left\lfloor (1 - \gamma)\beta \frac{\log n}{\log(r)} \right\rfloor, \quad\text{and}\quad \ell_0 = \lfloor n^\gamma\rfloor. \]