首页 | 本学科首页   官方微博 | 高级检索  
     检索      

完全3-一致超图的圈分解
引用本文:李冠儒,雷一鸣,杨元生,吉日木图.完全3-一致超图的圈分解[J].数学研究及应用,2016,36(1):9-14.
作者姓名:李冠儒  雷一鸣  杨元生  吉日木图
作者单位:内蒙古民族大学数学学院离散数学研究所, 内蒙古 通辽 028043;内蒙古民族大学数学学院离散数学研究所, 内蒙古 通辽 028043;内蒙古民族大学数学学院离散数学研究所, 内蒙古 通辽 028043; 大连理工大学计算机科学与技术学院, 辽宁 大连 116024;内蒙古民族大学数学学院离散数学研究所, 内蒙古 通辽 028043
基金项目:国家自然科学基金(Grant No.11161032).
摘    要:The problem of decomposing a complete 3-uniform hypergraph into Hamilton cycles was introduced by Bailey and Stevens using a generalization of Hamiltonian chain to uniform hypergraphs by Katona and Kierstead. Decomposing the complete 3-uniform hypergraphs K_n~(3) into k-cycles(3 ≤ k n) was then considered by Meszka and Rosa. This study investigates this problem using a difference pattern of combinatorics and shows that K_(n·5m)~(3) can be decomposed into 5-cycles for n ∈{5, 7, 10, 11, 16, 17, 20, 22, 26} using computer programming.

关 键 词:一致超图    5-圈    圈分解
收稿时间:2015/1/19 0:00:00
修稿时间:7/8/2015 12:00:00 AM

Decomposing Complete 3-Uniform Hypergraphs into Cycles
Guanru LI,Yiming LEI,Yuangsheng YANG and Jirimutu.Decomposing Complete 3-Uniform Hypergraphs into Cycles[J].Journal of Mathematical Research with Applications,2016,36(1):9-14.
Authors:Guanru LI  Yiming LEI  Yuangsheng YANG and Jirimutu
Institution:College of Mathematics, Institute of Discrete Mathematics of Inner Mongolia University for the Nationalities, Inner Mongolia 028043, P. R. China;College of Mathematics, Institute of Discrete Mathematics of Inner Mongolia University for the Nationalities, Inner Mongolia 028043, P. R. China;College of Mathematics, Institute of Discrete Mathematics of Inner Mongolia University for the Nationalities, Inner Mongolia 028043, P. R. China; School of Computer Science and Technology, Dalian University of Technology, Liaoning 116024, P. R. China;College of Mathematics, Institute of Discrete Mathematics of Inner Mongolia University for the Nationalities, Inner Mongolia 028043, P. R. China
Abstract:The problem of decomposing a complete 3-uniform hypergraph into Hamilton cycles was introduced by Bailey and Stevens using a generalization of Hamiltonian chain to uniform hypergraphs by Katona and Kierstead. Decomposing the complete 3-uniform hypergraphs $K^{(3)}_{n}$ into $k$-cycles ($3\leq k
Keywords:uniform hypergraph  5-cycle  cycle decomposition
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《数学研究及应用》浏览原始摘要信息
点击此处可从《数学研究及应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号