A network architect designs a system where each node $v$ must have at least $\lceil \frac{n}{2} \rceil$ neighbors to guarantee connectivity. If this network is modeled as a simple graph $G$ with $n$ vertices, which theorem provides the condition that ensures $G$ must contain a Hamiltonian path?