Ore's theorem 2026-10-31
Ore's theorem, named after Øystein Ore, says that a finite simple graph with vertices is Hamiltonian if every nonadjacent pair has degree sum at least .
For a proof, enlarge a hypothetical counterexample to an edge-maximal non-Hamiltonian graph. Adding a missing edge creates a Hamiltonian cycle, hence the original graph has a Hamiltonian path . If both and are edges, the path closes to a cycle by reversing its final segment. Thus the index sets of these two kinds of edges are disjoint in , giving , a contradiction. The degree condition is sufficient and need not follow from a lower bound of on every individual degree.
Øystein Ore Created 2026-10-31 Updated 2026-11-05
Øystein Ore worked in ring theory, Galois theory, lattice theory and graph theory. His work on noncommutative rings investigated when a ring can be embedded in a division ring, extending the idea of forming fractions beyond commutative arithmetic.
His later books also linked mathematical ideas with their history. The movement from algebraic structures to closure relations and graphs illustrates how an organizing mathematical viewpoint can lead into several different subjects.[ref]
Figure 1.
Portrait of Øystein Ore
. Identified external portrait in the University of St Andrews MacTutor collection; photographer not stated on the inspected display. Source.