On tight 9-cycle decompositions of complete 3-uniform hypergraphs
From MaRDI portal
Publication:5000306
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
Cites work
- scientific article; zbMATH DE number 3503285 (Why is no real title available?)
- Counting designs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Decomposing complete 3-uniform hypergraph \(k_n^{(3)}\) into 7-cycles
- Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
- Decomposing complete 3-uniform hypergraphs into cycles
- Hamiltonian chains in hypergraphs
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Hypercycle systems
- On Quadruple Systems
- On tight 6-cycle decompositions of complete 3-uniform hypergraphs
- The wonderful Walecki construction
Cited in
(8)- On tight 6-cycle decompositions of complete 3-uniform hypergraphs
- On tight 6-cycle and tight 9-cycle decompositions of complete 3-uniform hypergraphs minus a 1-factor
- scientific article; zbMATH DE number 7731175 (Why is no real title available?)
- Hypercycle systems from semi-parallel classes
- 6-cycle decompositions of complete 3-uniform hypergraphs
- scientific article; zbMATH DE number 5879560 (Why is no real title available?)
- Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\)
- scientific article; zbMATH DE number 7283879 (Why is no real title available?)
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)