Video 18: A simple graph with n vertices and k components can have at most (n-k)(n-k+1)/2 edges.

[@Deepak-ly3pl]

Is fully needed to prove, because in the textbook they have mentioned a bit small only.