A note on Hamilton decompositions of even-regular multigraphs
The electronic journal of combinatorics, Tome 31 (2024) no. 4
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ühn and Osthus about simple digraphs.
DOI :
10.37236/12637
Classification :
05C45, 05C35, 05C70, 05C20, 05C38, 05C48
Mots-clés : tournaments, Hamilton decomposition, robust expanders, Hamilton cycles
Mots-clés : tournaments, Hamilton decomposition, robust expanders, Hamilton cycles
Affiliations des auteurs :
Vincent Pfenninger  1
@article{10_37236_12637,
author = {Vincent Pfenninger},
title = {A note on {Hamilton} decompositions of even-regular multigraphs},
journal = {The electronic journal of combinatorics},
year = {2024},
volume = {31},
number = {4},
doi = {10.37236/12637},
zbl = {1556.05083},
url = {http://geodesic.mathdoc.fr/articles/10.37236/12637/}
}
Vincent Pfenninger. A note on Hamilton decompositions of even-regular multigraphs. The electronic journal of combinatorics, Tome 31 (2024) no. 4. doi: 10.37236/12637
Cité par Sources :