Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Opuscula Mathematica

1 2019

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: 7-cycle

Sortuj według:

Ogranicz wyniki do:

Decomposing complete 3-uniform hypergraph kn(3) into 7-cycles

Meihua, Guan Meiling, Jirimutu

Opuscula Mathematica

2019

Vol. 39, no. 3

383-–393

We use the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph. A decomposition of complete k-uniform hypergraph [formula] into Hamiltonian cycles was studied by Bailey-Stevens and Meszka-Rosa. For n ≡ 2,4, 5 (mod 6), we design an algorithm for decomposing the complete 3-uniform hypergraphs into Hamiltonian cycles by using the method of edge-partition. A decomposition of [formula] into 5-cycles has been presented for all admissible n ≤ 17, and for all n = 4m + 1 when m is a positive integer. In general, the existence of a decomposition into 5-cycles remains open. In this paper, we show if 42 | (n — 1)(n — 2) and if there exist [formula] sequences (ki0, ki1,…..,k16) on Dall(n), then [formula] can be decomposed into 7-cycles. We use the method of edge-partition and cycle sequence. We find a decomposition of [formula] and [formula] into 7-cycles.