How would one show that a simple graph with n vertices and more than (n-1)(n-2)/2 edges must be connected?
I appreciate any help. Thanks!
Follow Math Help Forum on Facebook and Google+
You should understand that this is not a homework service nor is it a tutorial service. Please either post some of your own work on this problem or explain what you do not understand about the question.
View Tag Cloud