内蒙古民族大学学报（自然科学版）2016，Vol.31Issue(1)：1-5,20,6.DOI:10.14045/j.cnki.15-1220.2016.01.001
完全3-一致超图K(3)32的5-圈分解
The Decomposition of Complcte 3-Uniforih Hypergraph K(3)32 into 5-cycles
摘要
Abstract
Bailey-Stevens and Meszka-Rosa studied the decomposition of complete k-Uniform Hypergraph into Hamiltonian cycles, and solved the decomposition of complete 3-Uniform Hypergraph into Hamiltonian cycles, when n≤32 . Bailey-Stevens and Meszka-Rosa introduced the decomposition of complete -uniform hypergraph into not Hamiltonian cycles. So far, the decomposition of complete 3-uniform hypergraph into 5-cycles is still open, beside n≤17 and n=4m+1 and (m is an integer). In this paper, we design a new algorithm based on partitions of the edges and get a result of the decomposition of K (3)32 into 5-cycles.关键词
一致超图/5-圈/圈分解Key words
Uniform Hypergraph/5-cycles/Decomposition into cycles分类
数理科学引用本文复制引用
雷一鸣,李冠儒,吉日木图..完全3-一致超图K(3)32的5-圈分解[J].内蒙古民族大学学报（自然科学版）,2016,31(1):1-5,20,6.基金项目
国家自然科学基金资助项目(11161032) （11161032）
