Post by vsiap on Dec 1, 2014 17:08:47 GMT
Since there can be no edges between vertices in different components, G will have the most edges when each of the components is a complete graph. Since Kni has C(ni,2) edges, the maximum number of edges is the sum given in the exercise.