Prove that a graph that has a Hamilton circuit

38 Views Asked by At

How can I prove this:

Let $G$ be a simple graph with with $n\geq3$ vertices and $m$ edges. If $m\geq \frac12 (n^2 - 3n +6),$ then $G$ has a Hamilton circuit.