Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles
We use the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph. A decomposition of complete \(k\)-uniform hypergraph \(K^{(k)}_{n}\) into Hamiltonian cycles was studied by Bailey-Stevens and Meszka-Rosa. For \(n\equiv 2,4,5\pmod 6\), we design an algorithm for decomposing the...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2019-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | https://www.opuscula.agh.edu.pl/vol39/3/art/opuscula_math_3923.pdf |