Solution

Dirac’s theorem states that if a simple graph with $n \ge 3$ vertices satisfies

$deg(v) \ge \frac{n}{2}$

for every vertex $v$, then the graph is Hamiltonian.

Thus the degree of each vertex must be at least half of the number of vertices.