Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles

DOI10.7494/OPMATH.2019.39.3.383zbMath1437.05174MaRDI QIDQ5106668

Meiling Guan, Jirimutu, Meihua

Publication date: 22 April 2020

Published in: Opuscula Mathematica (Search for Journal in Brave)

zbMATH Keywords

uniform hypergraphcycle decomposition7-cycle

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

On tight 6-cycle decompositions of complete 3-uniform hypergraphs ⋮ Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\) ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Paths and cycles of hypergraphs
• Hamilton decompositions of complete 3-uniform hypergraphs
• A possible analogue of \(\rho\)-labellings for 3-uniform hypergraphs
• Hamiltonian chains in hypergraphs
• Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs

This page was built for publication: Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles