If a simple graph with vertices, and if for each pair of non-adjacent vertices and , then is Hamiltonian. If any of the conditions in Ore’s Theorem are not satisfied, it doesn’t mean that the graph is not Hamiltonian.