Dirac's Theorem

Theorem
If a connected graph $G$ has $n \ge 3$ vertices and the degree of each vertex is at least $\dfrac n 2$, then $G$ is Hamiltonian.