Matthews–Sumner conjecture
Bondy–Murty, Graph Theory, Appendix A, item 79 · Hamilton paths and cycles
Status partial high confidence
The Matthews–Sumner conjecture (every 4-connected claw-free graph is Hamiltonian, 1984) remains open as of September 2026. Via Ryjáček's 1997 closure theorem it is equivalent to Thomassen's conjecture that every 4-connected line graph is Hamiltonian, also open. The strongest known partial result is Kaiser and Vrána (2012), who proved that every 5-connected line graph of minimum degree at least 6 is Hamiltonian, improving the previous threshold from 7-connected. A 2026 paper by Ozeki and Zhang addresses Hamiltonicity in 3-connected claw-free graphs with small domination number, motivated by Thomassen's conjecture, but does not resolve the 4-connected case.
Cited literature (2)
-
Proves that every 5-connected line graph of minimum degree at least 6 is Hamiltonian (and the result extends to claw-free graphs and Hamilton-connectedness), improving the previously known threshold of 7-connectivity but falling short of the conjectured 4-connectivity.
-
partial Hamiltonian Properties of 3-Connected Claw-Free Graphs and Line Graphs of 3-Hypergraphs (2026)
Proves that every 3-connected claw-free graph with domination number at most 5 is Hamiltonian (with limited exceptions), motivated by Thomassen's line graph conjecture; does not address the Matthews–Sumner conjecture for 4-connected graphs.
Reviewer notes. The conjecture is equivalent to Thomassen's conjecture (every 4-connected line graph is Hamiltonian) via Ryjáček's closure (1997), already noted in the book and tracked in OPG record hamiltonian_cycles_in_line_graphs. Searches were hampered by intermittent WebSearch failures; the arXiv and Open Problem Garden were consulted directly. No paper claiming a proof or counterexample of the full conjecture was found. The Kaiser–Vrána result (arXiv 1009.3754) is the key post-2008 partial result; its published form appeared in J. Combin. Theory Ser. B 103 (2013) 461–477 (year cited as 2012 matching arXiv submission year commonly used). The Ozeki–Zhang 2026 preprint is included as the most recent work motivated by the same circle of conjectures.
Context
Equivalent, via Ryjáček's closure, to Thomassen's conjecture that every 4-connected line graph is Hamiltonian.
In the book: Exercise 19.3.16.
Related records in this index
This conjecture had no record of its own; it was only covered indirectly by the records below.
- Hamiltonian cycles in line graphs — equivalent (Ryjáček 1997)
Source
Théorie des graphes (J.A. Bondy, U.S.R. Murty; French edition by Frédéric Havet, 2025), Appendix A « Problèmes ouverts »
Item 79, book p. 633 (PDF p. 649) ·
https://inria.hal.science/hal-05211979v1 ·
PDF
English edition: J.A. Bondy, U.S.R. Murty, Graph Theory, GTM 244, Springer 2008, Appendix A.