Decompositions of the complete 3-uniform hypergraph of order 8 into Hamiltonian cycles
A definition of a Hamiltonian cycle is due to Katona-Kierstead:
A Hamiltonian cycle in a complete k-uniform
hypergraph or order n
is a cyclic ordering of its vertices such that each consecutive
k-tuple of vertices is
a hyperedge.
There are 312 pairwise nonisomorphic decompositions.
In a file below, for every solution 7 base Hamiltonian cycles
are given; the remaining cycles can be obtained
by developing those base cycles mod 8.