Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles
From MaRDI portal
Publication:5106710
DOI10.7494/OpMath.2020.40.2.209zbMath1437.05191MaRDI QIDQ5106710
Dontez Collins, Ryan C. Bunge, Rachel Liebrecht, Alexander Vasquez, Daryl Conko-Camel, Saad I. El-Zanati
Publication date: 22 April 2020
Published in: Opuscula Mathematica (Search for Journal in Brave)
Extremal problems in graph theory (05C35) 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 (1)
Cites Work
- On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Decomposition of the complete hypergraph into delta-systems. II
- Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
- Counting designs
- Solution of a delta-system decomposition problem
- Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
- On Quadruple Systems
- A survey on the existence ofG-Designs
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles