On loose 4-cycle decompositions of complete 3-uniform hypergraphs

MaRDI QIDQ5206554zbMATH OpenFDO

Authors R. C. Bunge, Lauren Haman, Cody Hatzer, Kristin Koe, Kayla Spornberger, S. I. El-Zanati

Publication date 18 December 2019

zbMATH Keywords

hypergraph decompositionloose cyclespectrum problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 7731175
• 4-cycle decompositions of complete 3-uniform hypergraphs
• A decomposition of complete bipartite \(4\)-uniform hypergraphs \(K_4^{5,5}\) into loose cycles of length \(5, 10\)
• 6-cycle decompositions of complete 3-uniform hypergraphs
• On tight 6-cycle decompositions of complete 3-uniform hypergraphs

Cited in

(9)

• On tight 6-cycle decompositions of complete 3-uniform hypergraphs
• Decompositions of 3-uniform hypergraph \(K_v^{(3)}\) into hypergraph \(K_4^{3}+ e\)
• A decomposition of complete bipartite \(4\)-uniform hypergraphs \(K_4^{5,5}\) into loose cycles of length \(5, 10\)
• 4-cycle decompositions of complete 3-uniform hypergraphs
• Maximum packings of the \(\lambda\)-fold complete 3-uniform hypergraph with loose 3-cycles
• scientific article; zbMATH DE number 7731175 (Why is no real title available?)
• On decompositions of complete 3-uniform hypergraphs into a linear forest with 4 edges
• Decomposing the -fold complete 3-uniform hypergraph into the lines of the Pasch configuration
• The spectrum problem for the 4-uniform 4-colorable 3-cycles with maximum degree 2

This page was built for publication: On loose 4-cycle decompositions of complete 3-uniform hypergraphs

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