0
$\begingroup$

Possible Duplicate:
Proving component size based on number of edges and vertices.

Prove that if $G$ has more than $\dfrac{5n^2}{18}$ edges then $G$ has no connected component of size (number of vertices) between $\dfrac{n}{3}$ and $\dfrac{2n}{3}$.

I'm not even sure where to start nor what is being asked in regards to the connectedness of the graph. Is this question alluding to graphs with two or more components?

  • 0
    [Previous comment](http://math.stackexchange.com/questions/248866/discrete-mathematics-graph-theory#comment547525_248866)2012-12-01
  • 0
    See this ongoing assignment: [link to assignment, see (3)b.](http://www.math.mcgill.ca/louigi/courses/20122013/math240/a5.pdf)2012-12-01

0 Answers 0