Ore's theorem

Ore's theorem is a classical result in Graph theory providing a simple degree condition guaranteeing the existence of a Hamiltonian cycle in a finite simple graph. The theorem complements criteria such as Dirac's theorem and connects to the study of Eulerian and Hamiltonian structures investigated by figures like William Rowan Hamilton and Leonhard Euler. It has been influential in the development of combinatorial methods used in work by authors affiliated with institutions such as Princeton University, University of Oslo, and Cambridge University.

Statement

Let G be a finite simple graph on n ≥ 3 vertices. If for every pair of distinct nonadjacent vertices u and v in G the sum of their degrees satisfies deg(u) + deg(v) ≥ n, then G contains a Hamiltonian cycle. The condition links vertex-degree parameters and global cyclic structure and is often compared to degree bounds appearing in results by Paul Dirac and in conjectures considered by Pósa and Chvátal.

Proof

Ore's original proof employs constructive and extremal techniques characteristic of mid‑20th‑century combinatorics. One considers a maximal non‑Hamiltonian graph satisfying the degree condition and inspects a longest cycle C in that graph. By analyzing chords, connections between vertices on C, and possible attachments of vertices outside C, a contradiction with maximality is derived. Key steps invoke arguments reminiscent of those used in proofs by Dirac, and exploit elementary properties of degrees and paths that feature in work associated with Tibor Gallai and Paul Erdős. Variants of the proof make use of closure operations similar to those in Bondy–Chvátal theorem methods and build on techniques found in monographs from Cambridge University Press and lecture notes by researchers at Massachusetts Institute of Technology.

Sharpness and Examples

The theorem is sharp in the sense that weakening the inequality to deg(u)+deg(v) ≥ n−1 does not ensure Hamiltonicity in general. Standard extremal examples include the join of a complete graph with an independent set where the degree sum condition fails by one; such constructions are discussed in surveys by Béla Bollobás and in counterexample collections taught at University of Cambridge and Harvard University. Specific families showing sharpness often appear in literature treating constructions by Turán and extremal configurations related to the Mantel's theorem style extremal graphs. Examples include graphs formed from two cliques joined by a small cutset, and multipartite constructions studied by researchers at Princeton University and ETH Zurich.

Applications and Consequences

Ore's theorem is applied widely in algorithmic and theoretical contexts: in the design of sufficient checks for Hamiltonicity in heuristics studied at Bell Labs and in complexity analyses related to NP‑complete problems like the Hamiltonian cycle problem explored by groups at MIT and Stanford University. It provides a tool in proofs of other sufficiency results, informs closure concepts used in the Bondy–Chvátal theorem, and appears in combinatorial proofs concerning traceability and toughness as investigated by scholars at Ohio State University and University of Waterloo. Consequences include corollaries strengthening bounds for special graph classes such as chordal graphs and claw‑free graphs reviewed in texts from Springer and conference proceedings of the ACM and the SIAM.

Generalizations and Related Results

Several generalizations and related theorems expand Ore's condition. The Bondy–Chvátal theorem replaces degree sums by a closure operation leading to a characterization for Hamiltonicity under iterative edge additions; this result influenced subsequent work by John Bondy and Václav Chvátal. Other extensions include Ore‑type conditions for directed graphs studied in the context of Moon–Moser theorem analogues, degree‑sequence criteria by Chvátal and Erdős–Gallai theorem‑style comparisons, and toughness conditions explored by Chvátal and later researchers at McGill University and University of British Columbia. Researchers have also developed Ore‑type conditions for pancyclicity and for Hamiltonian decomposition results related to work by Walecki and in design theory treated by scholars at Institute of Mathematics of the Polish Academy of Sciences.

Category:Graph theory theorems