Prove that if a graph has > (n-1)(n-2) /2 edges, it is connected.
The Attempt at a Solution
I've drawn several examples and made tables, and I can see that the graph is indeed connected if it has more edges than [(n-1)(n-2)]/2. But what I cannot do so far is prove it. How can I start doing this proof?