Decomposing Complete 3-uniform Hypergraph into 7-cycles
- 10.2991/mcei-17.2017.184How to use a DOI?
- Uniform hypergraph; 7-cycle; Cycle decomposition
On the basic of the definition of Hamiltonian cycle defined by Katona-Kierstead and Jianfang Wang independently. Some domestic and foreign researchers study the decomposition of complete 3-uniform hypergraph into Hamiltonian cycles and not Hamiltonian cycles. Especially , Bailey Stevens using Clique - finding the decomposition of into Hamiltonian cycles for , . Meszka-Rosa showed that Hamiltonian decompositions of for all admissible . Meszka-Rosa proved that a decomposition of into 5-cycles has been presented for all admissible , and for all , is a positive integer. In general, the existence of a decomposition into -cycles remains open. The authors have given the decomposition of into 7-cycles for and has showed if can be decomposition into 7-cycles, then can be decomposition into 7-cycles. In this paper, a decomposition of into 7-cycles is proved using the method of edge-partition and cycle sequence proposed by Jirimutu.
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Guan Meiling AU - Xu Chunlei PY - 2017/12 DA - 2017/12 TI - Decomposing Complete 3-uniform Hypergraph into 7-cycles BT - Proceedings of the 2017 7th International Conference on Mechatronics, Computer and Education Informationization (MCEI 2017) PB - Atlantis Press SP - 860 EP - 865 SN - 2352-538X UR - https://doi.org/10.2991/mcei-17.2017.184 DO - 10.2991/mcei-17.2017.184 ID - Meiling2017/12 ER -