Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
We prove that, for large n, every 3-connected D-regular graph on n vertices with is Hamiltonian. This is best possible and verifies the only remaining case of a conjecture posed independently by Bollobás and Häggkvist in the 1970s. The proof builds on a structural decomposition result proved recent...
Prif Awduron: | Kühn, D, Lo, A, Osthus, D, Staden, K |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
Elsevier
2015
|
Eitemau Tebyg
-
An exact minimum degree condition for Hamilton cycles in oriented graphs
gan: Keevash, P, et al.
Cyhoeddwyd: (2008) -
Matchings and Hamilton cycles in hypergraphs
gan: Daniela Kühn, et al.
Cyhoeddwyd: (2005-01-01) -
A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
gan: Sah, Ashwin, et al.
Cyhoeddwyd: (2021) -
A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
gan: Sah, Ashwin, et al.
Cyhoeddwyd: (2021) -
On the Bishop-Phelps-Bollobás Property for Numerical Radius
gan: Sun Kwang Kim, et al.
Cyhoeddwyd: (2014-01-01)