Abstract
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.
Subject
Computer Science Applications,History,Education
Reference13 articles.
1. The wonderful Walecki construction;Alspach;J. Bull. Inst. Combin. Appl.,2008
2. Handbook of graph theory;Gross,2004
3. On decomposition of r-partite graphs into edge-disjoint hamilton circuits;Renu;J Discrete Mathematics,1976
4. Hamiltonian chains in hypergraphs[J];Katona;Graph Theory,1999
5. Hamiltonian decomposition of complete k-uniform hypergraphs[J];Bailey;Discrete Mathematics,2010