Decomposing Complete 3-Uniform Hypergraph (3) 45 K into 7−Cycles

De-yu YU, Jirimutu

Abstract


About the Jianfang Wang-Tony Lee and Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph, respectively. In general, the existence of a decomposition into 7 − cycles remains open. In this paper, we use the method of edge-partition and cycle sequence proposed by Jirimutu and Jianfang Wang. We find a new result.

Keywords


Uniform hypergraph, 7-cycle, Cycle decomposition


DOI
10.12783/dteees/eesd2017/11995

Refbacks

  • There are currently no refbacks.