| Decomposing Complete 3-Uniform Hypergraphs into Cycles |
| Received:January 19, 2015 Revised:July 08, 2015 |
| Key Words:
uniform hypergraph 5-cycle cycle decomposition
|
| Fund Project:Supported by the National Natural Science Foundation of China (Grant No.11161032). |
| Author Name | Affiliation | | Guanru LI | College of Mathematics, Institute of Discrete Mathematics of Inner Mongolia University for the Nationalities, Inner Mongolia 028043, P. R. China | | Yiming LEI | College of Mathematics, Institute of Discrete Mathematics of Inner Mongolia University for the Nationalities, Inner Mongolia 028043, P. R. China | | Yuangsheng YANG | 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 | | Jirimutu | College of Mathematics, Institute of Discrete Mathematics of Inner Mongolia University for the Nationalities, Inner Mongolia 028043, P. R. China |
|
| Hits: 3220 |
| Download times: 1875 |
| 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 |
| Citation: |
| DOI:10.3770/j.issn:2095-2651.2016.01.002 |
| View Full Text View/Add Comment |
|
|
|
