All regular multigraphs of even order and high degree are 1-factorable (Q5954314)

Summary: \textit{M. J. Plantholt} and \textit{S. K. Tipnis} [J. Lond. Math. Soc., II. Ser. 44, No. 3, 393-400 (1991; Zbl 0760.05073)] proved that for any even integer \(r\), a regular multigraph \(G\) with even order \(n\), multiplicity \(\mu(G) \leq r\) and degree high relative to \(n\) and \(r\) is 1-factorable. Here we extend this result to include the case when \(r\) is any odd integer. Häggkvist and \textit{L. Perković} and \textit{B. Reed} [Discrete Math. 165/166, 567-578 (1997; Zbl 0902.05030)] proved that the one-factorization conjecture for simple graphs is asymptotically true. Our techniques yield an extension of this asymptotic result on simple graphs to a corresponding asymptotic result on multigraphs.