A note on Hamilton decompositions of even-regular multigraphs
Combinatorics
2023-12-18 v1
Abstract
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\"uhn and Osthus about simple digraphs.
Cite
@article{arxiv.2312.09873,
title = {A note on Hamilton decompositions of even-regular multigraphs},
author = {Vincent Pfenninger},
journal= {arXiv preprint arXiv:2312.09873},
year = {2023}
}
Comments
6 pages