{"paper":{"title":"Edge-disjoint Hamilton cycles in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Fiachra Knox","submitted_at":"2011-04-22T08:42:59Z","abstract_excerpt":"We show that provided $\\log^{50} n/n \\leq p \\leq 1 - n^{-1/4}\\log^9 n$ we can with high probability find a collection of $\\lfloor \\delta(G)/2 \\rfloor$ edge-disjoint Hamilton cycles in $G \\sim G_{n, p}$, plus an additional edge-disjoint matching of size $\\lfloor n/2 \\rfloor$ if $\\delta(G)$ is odd. This confirms, for the above range of $p$, a conjecture of Frieze and Krivelevich."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4412","kind":"arxiv","version":3},"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"}