Ore's theorem
= Ore's theorem
{wiki=Ore's_theorem}
Ore's theorem is a result in graph theory concerning the conditions under which a graph is Hamiltonian, meaning that it contains a Hamiltonian circuit (a cycle that visits every vertex exactly once).