Theorem 2.1 ([1]}) 

For every \(n,t,r\in \mathbb {N}\) , the following holds. Every graph \(G\)  on \(n\)  vertices which is \(x\) -far from being \(r\) -partite contains at least
\(\frac{n^{r-1}}{e^{2r}r!}\left( e(G) +x - \left( 1-\frac{1}{r} \right)\frac{n^2}{2}\right)\) 
