Maximal sets of Hamilton cycles in complete multipartite graphs IV

Finding the values of μ for which there exists a maximal set of μ edge-disjoint Hamilton cycles in the complete multipartite graph Knp has been considered in papers for over 20 years. This paper finally settles the problem by finding such a set in the last remaining open case, namely where μ is as s...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 345; no. 8; p. 112932
Main Authors Tidwell, David M., Rodger, C.A.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.08.2022
Subjects
05C70
Amalgamation
Decomposition
Hamilton cycle
Hamilton cycle
Amalgamation
05C70
Decomposition
Online AccessGet full text

Cover

More Information
Summary:Finding the values of μ for which there exists a maximal set of μ edge-disjoint Hamilton cycles in the complete multipartite graph Knp has been considered in papers for over 20 years. This paper finally settles the problem by finding such a set in the last remaining open case, namely where μ is as small as possible (so its existence was still in doubt) when n=3 and the number of parts, p, is 3 (mod 4).
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2022.112932