Here is a classic problem.
If is the number of edges and prove the graph is connected.
The maximum number of edges in a graph of order is . If we add another vertex, any new edge will have to join the new vertex to one of the original vertices and the graph becomes connected.
So, are you saying that the answer to my question in post #1 is ?