arXiv:2312.09873 [math.CO]AbstractReferencesReviewsResources
A note on Hamilton decompositions of even-regular multigraphs
Published 2023-12-15Version 1
In this note, we prove that every even regular multigraph on $n$ vertices with multiplicity at most $r$ and minimum degree at least $rn/2 + o(n)$ has a Hamilton decomposition. This generalises a result of Vaughan who proved an asymptotic version of the multigraph $1$-factorisation conjecture. We derive our result by proving a more general result which states that dense regular multidigraphs that are robust outexpanders have a Hamilton decomposition. This in turn is derived from the corresponding result of K\"uhn and Osthus about simple digraphs.
Comments: 6 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1010.5192 [math.CO] (Published 2010-10-25)
An Asymptotic Version of the Multigraph 1-Factorization Conjecture
arXiv:1408.5211 [math.CO] (Published 2014-08-22)
Vertex-transitive graphs that have no Hamilton decomposition
arXiv:1710.06037 [math.CO] (Published 2017-10-17)
On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions