If I already know edges how can I get the maximum number of vertices?
Question: There is a graph that has $36$ edges, and where every vertex has degree at least $5$. What is the maximum number of vertices this graph could have?
I think the sum of degrees is $36\cdot 2$ which is $72$. And the sum of degrees is bigger or equal than adding the least degree of every vertices together.
Therefore, $72\geq 5n$ and then $14.4\geq n$, so the maximum number of vertices is $14$. Is it correct?