This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Bondy–Chvátal theorem | |
|---|---|
| Name | Bondy–Chvátal theorem |
| Field | Graph theory |
| Proved | 1976 |
| Authors | John Adrian Bondy; Václav Chvátal |
| Keywords | Hamiltonian graph, closure, degree sequence |
Bondy–Chvátal theorem The Bondy–Chvátal theorem is a fundamental result in graph theory that characterizes when a simple undirected graph can be extended to a Hamiltonian graph by repeatedly adding edges between sufficiently high-degree nonadjacent vertices. Originating in a 1976 paper by John Adrian Bondy and Václav Chvátal, the theorem links degree conditions to Hamiltonicity and unifies earlier criteria such as Dirac and Ore. It has influenced structural graph theory, extremal graph problems, and algorithmic approaches to Hamiltonian cycle detection.
Let G be a simple undirected graph on n vertices. If u and v are distinct nonadjacent vertices of G with deg(u)+deg(v) ≥ n, then add the edge uv. Repeat this "closure" operation until no such pair remains; the resulting graph G* is the closure of G. The Bondy–Chvátal theorem states that G is Hamiltonian if and only if its closure G* is Hamiltonian. This equivalence allows one to reduce Hamiltonicity questions to the study of closure graphs, connecting to criteria by Paul Dirac (mathematician), Oystein Ore, and results in the tradition of Rédei (mathematician) and Dirac-type sufficient conditions.
Bondy and Chvátal developed the theorem against a backdrop of mid-20th-century advances in Hamiltonian graph theory. Earlier milestones included Dirac's theorem (1952) and Ore's theorem (1960), both providing degree-sum conditions ensuring Hamiltonian cycles. The theorem synthesizes these by introducing the closure operation, drawing on combinatorial ideas explored by Tibor Gallai, Paul Erdős, Alfréd Rényi, and contributors to extremal graph theory such as Pál Erdős collaborators. It was motivated by attempts to find a unifying framework for degree conditions, influenced by problems studied in conferences and publications associated with institutions like the London Mathematical Society and the Mathematical Association of America.
Bondy and Chvátal's original proof uses induction on the number of nonedges and augmentation arguments typical of classical graph theory. Key tools include degree-sequence transformations, closure invariance, and rotation-extension techniques related to methods later formalized by researchers like Lajos Pósa and Endre Szemerédi. Alternative proofs leverage matching theory via the Tutte theorem, connectivity arguments related to the Menger's theorem framework, and extremal combinatorics approaches inspired by Paul Erdős and Turán's theorem (Turan) style reasoning. Algorithmic proofs use greedy closure construction and rely on complexity results connected to work by Richard M. Karp on NP-completeness of Hamiltonian cycle problems in general graphs.
The Bondy–Chvátal theorem provides a unifying lens for multiple sufficient conditions for Hamiltonicity, simplifying proofs of Dirac's and Ore's theorems and yielding corollaries for graphs with specified degree sequences studied by George H. Hardy contemporaries and theoreticians like S. L. Hakimi. It informs algorithmic heuristics for Hamiltonian cycle search used in practical problems addressed by researchers at institutions such as Bell Labs, Microsoft Research, and university groups including MIT and Princeton University. The closure concept has consequences for structural graph classes studied by Paul Seymour and Neil Robertson, impacts extremal results from the Erdős–Gallai theorem lineage, and interacts with toughness parameters considered by Václav Chvátal himself in other conjectures.
Classic examples illustrating the theorem include graphs meeting Dirac's threshold (minimum degree ≥ n/2), where closure immediately yields the complete graph K_n, and so Hamiltonicity follows; this connects to the family of complete graphs studied by Arthur Cayley and William Rowan Hamilton. Nontrivial examples are sparse graphs whose closure adds a small number of edges to create K_n, reflecting constructions from Turán-type extremal examples. Counterexamples show that degree-sum conditions below the threshold need not imply Hamiltonicity; notable constructions and obstructions were analyzed by Chvátal and collaborators and relate to non-Hamiltonian graphs such as certain generalized Petersen graphs investigated by H. S. M. Coxeter and others.
Numerous generalizations extend the closure concept to directed graphs, hypergraphs, and degree-constrained variants. Directed analogues build on work by Camion and relate to tournaments studied by L. S. Shapley contexts; hypergraph extensions connect to research by Paul Erdős and Dorothy Maharam style combinatorialists. Related results include Chvátal's toughness conjecture, Bondy's theorems on pancyclicity, and closure-based criteria in the literature of Béla Bollobás, János Komlós, and Endre Szemerédi. The theorem also sits alongside characterizations of Hamiltonian properties in special classes such as chordal graphs, bipartite graphs, and planar graphs investigated at institutions like Carnegie Mellon University and University of Cambridge.
Category:Theorems in graph theory