{"paper":{"title":"Solution to a problem of Bollob\\'as and H\\\"aggkvist on Hamilton cycles in regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Daniela K\\\"uhn, Deryk Osthus, Katherine Staden","submitted_at":"2014-02-19T18:18:16Z","abstract_excerpt":"We prove that, for large $n$, every $3$-connected $D$-regular graph on $n$ vertices with $D \\geq n/4$ is Hamiltonian. This is best possible and confirms a conjecture posed independently by Bollob\\'as and H\\\"aggkvist in the 1970s. The proof builds on a structural decomposition result proved recently by the same authors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4754","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}