On tight 9-cycle decompositions of complete 3-uniform hypergraphs
From MaRDI portal
Publication:5000306
zbMATH Open1468.05224MaRDI QIDQ5000306FDOQ5000306
Anna C. Stover, Brian D. jun. Darrow, Alexander J. Romer, Alexandra Squires, Kimberly P. Hadaway, R. C. Bunge, Megan K. Pryor, S. I. El-Zanati
Publication date: 12 July 2021
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p233.pdf
Recommendations
- On tight 6-cycle decompositions of complete 3-uniform hypergraphs
- Decomposition of complete 3-uniform hypergraphs \(K^3_n\) into cycles for \(n = 7, 10\)
- scientific article; zbMATH DE number 7731175
- Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length
- 6-cycle decompositions of complete 3-uniform hypergraphs
Paths and cycles (05C38) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On Quadruple Systems
- Counting designs
- Hamiltonian chains in hypergraphs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Title not available (Why is that?)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- The wonderful Walecki construction
- Title not available (Why is that?)
- Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles
- Decomposing complete 3-uniform hypergraphs into cycles
- On tight 6-cycle decompositions of complete 3-uniform hypergraphs
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: On tight 9-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 Q5000306)
