I have a proof to do for school.
Prove that in any simple graph G with n vertices and m edges, 2m <= n^2 - n
I just need a little push in the right direction. I'm having trouble even coming up with a starting point. I also cannot find many problems similar to this one so that I may practice.
Prove that in any simple graph G with n vertices and m edges, 2m <= n^2 - n
I just need a little push in the right direction. I'm having trouble even coming up with a starting point. I also cannot find many problems similar to this one so that I may practice.