Dirac's Theorem

Theorem
Let $G$ be a connected graph with $n$ vertices such that $n > 3$.

Let the degree of each vertex be at least $\dfrac n 2$.

Then $G$ is Hamiltonian.