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

zbMATH Open1427.05172MaRDI QIDQ5206554FDOQ5206554

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

Publication date: 18 December 2019

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

zbMATH Keywords

loose cyclehypergraph decompositionspectrum problem

Mathematics Subject Classification ID

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

Cited In (2)

• Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles
• Title not available (Why is that?)

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)