Decomposing Complete 3-Uniform Hypergraph Kn(3) into 7-cycles
Decomposing Complete 3-Uniform Hypergraph Kn(3) into 7-cycles
This paper respectively introduces the Jianfang Wang-Tony Lee and Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph.In general, the existence of decomposition into 7-cyces remains open.In this paper, researchers use the method of edge-partition and cycle sequence proposed by Jirimutu and Jianfang Wang.Researchers find a new result.