Take a graph $G$ on $n\ge 4$ vertices and suppose that every vertex has degree at least $\frac12n$. Does $G$ necessarily contain a Hamiltonian cycle? (Either give a proof or provide a counter-example.)
Hamiltonian Cycles and minimum vertex degrees
2
$\begingroup$
graph-theory
discrete-mathematics