Abstract
We use the Katona-Kierstead definition of a Hamilton cycle in a uniform hypergraph. We construct a polynomial to find the Hamilton cycle decomposition. Then the existence of large sets of these decompositions is given by using a complete automorphism group.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.