Decomposing complete 3-uniform hypergraphs into cycles

DOI10.3770/J.ISSN:2095-2651.2016.01.002MaRDI QIDQ2824013zbMATH OpenFDO

Authors Guanru Li, Yiming Lei, Yuansheng Yang, Jirimutu

Publication date 6 October 2016

Published in Journal of Mathematical Research with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3770/J.ISSN:2095-2651.2016.01.002

zbMATH Keywords

5-cyclecycle decompositionuniform hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Cycle decompositions in 3-uniform hypergraphs
• Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
• Decompositions of complete 3-uniform hypergraphs into cycles of some special even lengths
• Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length
• Decomposing the complete 3-uniform hypergraphs \(k_n^{(3)}\) into Hamiltonian cycles
• 4-cycle decompositions of complete 3-uniform hypergraphs
• Decomposition of complete 3-uniform hypergraphs K^3_n into cycles for n = 7, 10
• Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs
• Decomposing complete 3-uniform hypergraph \(k_n^{(3)}\) into 7-cycles
• scientific article; zbMATH DE number 847840

Cited in

(6)

• Decompositions of the 3-uniform hypergraphs \(K_{v}^{(3)}\) into hypergraphs of a certain type
• On tight 6-cycle decompositions of complete 3-uniform hypergraphs
• On tight 9-cycle decompositions of complete 3-uniform hypergraphs
• Decomposing complete 3-uniform hypergraph \(k_n^{(3)}\) into 7-cycles
• Hypercycle systems from semi-parallel classes
• On tight 6-cycle decompositions of complete 3-uniform multi-hypergraphs

This page was built for publication: Decomposing complete 3-uniform hypergraphs into cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2824013)