I'm working on proving that if a simple graph with $n$ vertices has more than $5n^2/18$ edges then the graph has no connected component of size between $n/3$ and $2n/3$.
Logically, I think I could show it but I'm not sure how to prove it.
Thanks
I'm working on proving that if a simple graph with $n$ vertices has more than $5n^2/18$ edges then the graph has no connected component of size between $n/3$ and $2n/3$.
Logically, I think I could show it but I'm not sure how to prove it.
Thanks