Ore's Theorem

Theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle.