Abstract
In this paper we give an approximate answer to a question of Nash-Williams from 1970: we show that for every α>0, every sufficiently large graph on n vertices with minimum degree at least (1/2+α)n contains at least n/8 edge-disjoint Hamilton cycles. More generally, we give an asymptotically best possible answer for the number of edge-disjoint Hamilton cycles that a graph G with minimum degree δ must have. We also prove an approximate version of another long-standing conjecture of Nash-Williams: we show that for every α>0, every (almost) regular and sufficiently large graph on n vertices with minimum degree at least (1/2+α)n can be almost decomposed into edge-disjoint Hamilton cycles.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
