Decomposing Complete 3-Uniform Hypergraph Kn(3) into 7-cycles

被引：0
|
作者：
Yan, Hong [1 ]
Jirimutu [2 ]
机构：
[1] Inner Mongolia Univ Nationalities, Coll Math, Tongliao, Peoples R China
[2] Inner Mongolia Univ Nationalities, Inst Discrete Math, Tongliao, Peoples R China
来源：
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON LOGISTICS, ENGINEERING, MANAGEMENT AND COMPUTER SCIENCE (LEMCS 2015) | 2015年 / 117卷
关键词：
Uniform Hypergraph; 7-cycle; Cycle Sequence; Cycle Decomposition; Hamiltonian Cycle;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper respectively introduces the Jianfang Wang-Tony Lee and Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph. In general, the existence of decomposition into 7-cyces remains open. In this paper, researchers use the method of edge-partition and cycle sequence proposed by Jirimutu and Jianfang Wang. Researchers find a new result.
引用
收藏
页码：1272 / 1274
页数：3
相关论文
共 50 条
  • [1] DECOMPOSING COMPLETE 3-UNIFORM HYPERGRAPH Kn(3) INTO 7-CYCLES
    Meihua
    Guan, Meiling
    Jirimutu
    OPUSCULA MATHEMATICA, 2019, 39 (03) : 383 - 393
  • [2] Decomposing Complete 3-Uniform Hypergraph K44(3) into 7-cycles
    Guan, Meiling
    Xu, Chunlei
    Jirimutu
    PROCEEDINGS OF THE 2017 7TH INTERNATIONAL CONFERENCE ON MECHATRONICS, COMPUTER AND EDUCATION INFORMATIONIZATION (MCEI 2017), 2017, 75 : 860 - 865
  • [3] Decomposing Complete 3-Uniform Hypergraphs into Cycles
    Guanru LI
    Yiming LEI
    Yuansheng YANG
    Jirimutu
    Journal of Mathematical Research with Applications, 2016, 36 (01) : 9 - 14
  • [4] Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
    Meszka, Mariusz
    Rosa, Alexander
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2009, 45 : 291 - 302
  • [5] MAXIMUM PACKINGS OF THE λ-FOLD COMPLETE 3-UNIFORM HYPERGRAPH WITH LOOSE 3-CYCLES
    Bunge, Ryan C.
    Collins, Dontez
    Conko-Camel, Daryl
    El-Zanati, Saad I.
    Liebrecht, Rachel
    Vasquez, Alexander
    OPUSCULA MATHEMATICA, 2020, 40 (02) : 209 - 225
  • [6] The characteristic polynomial of the complete 3-uniform hypergraph
    Zheng, Ya-Nan
    Linear Algebra and Its Applications, 2021, 627 : 275 - 286
  • [7] The characteristic polynomial of the complete 3-uniform hypergraph
    Zheng, Ya-Nan
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2021, 627 : 275 - 286
  • [8] The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
    Haxell, P. E.
    Luczak, T.
    Peng, Y.
    Roedl, V.
    Rucinski, A.
    Skokan, J.
    COMBINATORICS PROBABILITY & COMPUTING, 2009, 18 (1-2): : 165 - 203
  • [9] Decompositions of λ-fold complete bipartite 3-uniform hypergraphs λKn,n(3) into hypergraph K4(3) - e
    Zhao, Hongtao
    Zhang, Qingyun
    UTILITAS MATHEMATICA, 2020, 115 : 227 - 237
  • [10] The Hardness of 3-Uniform Hypergraph Coloring
    Irit Dinur*
    Oded Regev†
    Clifford Smyth‡
    Combinatorica, 2005, 25 : 519 - 535
12345