内蒙古民族大学学报（自然科学版）2024，Vol.39Issue(4)：9-13,5.DOI:10.14045/j.cnki.15-1220.2024.04.002
完全3-一致超图K(3)41的5-圈分解
A Decomposition of Complete 3-uniform Hypergraph K(3)41 into 5-cycles
摘要
Abstract
A hypergraph is a subset system of finite sets,which is closely related to databases.From the per-spective of database theory,the cycle-structure is the most essential and fundamental structure in hypergraph theory.The cycle decomposition of hypergraphs is one of the important research topics in hypergraph theory.Researchers have studied the Hamiltonian cycle and non-Hamiltonian cycle decomposition of hypergraphs.By utilizing the corre-lation between the cycle decomposition sequence of a hypergraph and its edge partition sequence,it is investigated that the open problem of decomposing the complete 3-uniform hypergraph with n order into 5-cycles,and it is proved that the validity of the open problem when n=41.关键词
完全3-一致超图/圈分解/5-圈分解Key words
complete 3-uniform hypergraph/cycle decomposition/5-cycle decomposition分类
数理科学引用本文复制引用
冯伟,Enkhtsolmon,尹艳,徐春雷,李冠儒..完全3-一致超图K(3)41的5-圈分解[J].内蒙古民族大学学报（自然科学版）,2024,39(4):9-13,5.基金项目
内蒙古自治区自然科学基金项目(2022LHMS01006) （2022LHMS01006）
内蒙古自治区直属高校基本科研业务费项目(GXKY22156) （GXKY22156）
内蒙古民族大学博士科研启动基金项目(BSZ013,BSZ014,BS643) （BSZ013,BSZ014,BS643）
