加载中…
In this note, we prove that every even regular multigraph on vertices with multiplicity at most and minimum degree at least has a Hamilton decomposition. This generalises a result of Vaughan who proved an asymptotic version of the multigraph -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ühn and Osthus about simple digraphs.

生成讲解博客的中文版本

生成AI智能校验的中文版本