scientific article; zbMATH DE number 7731175

MaRDI QIDQ6134955zbMATH OpenFDO

Authors R. C. Bunge, S. I. El-Zanati, Peter Florido

Publication date 23 August 2023

Full work available at URL http://ajc.maths.uq.edu.au/pdf/86/ajc_v86_p336.pdf

zbMATH Keywords

decompositions of graphsbalanced incomplete block design of index 1

Mathematics Subject Classification ID

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

Recommendations

• On loose 4-cycle decompositions of complete 3-uniform hypergraphs
• 4-cycle decompositions of complete 3-uniform hypergraphs
• 6-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\)
• On tight 9-cycle decompositions of complete 3-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 3754720 (Why is no real title available?)
• scientific article; zbMATH DE number 3478938 (Why is no real title available?)
• scientific article; zbMATH DE number 3503285 (Why is no real title available?)
• scientific article; zbMATH DE number 3611379 (Why is no real title available?)
• 4-cycle decompositions of complete 3-uniform hypergraphs
• A survey on the existence ofG-Designs
• Counting designs
• Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
• Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs
• Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
• Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs
• Hamilton cycle decompositions of \(k\)-uniform \(k\)-partite hypergraphs
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Maximum packings of the \(\lambda\)-fold complete 3-uniform hypergraph with loose 3-cycles
• On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
• On Quadruple Systems
• On loose 4-cycle decompositions of complete 3-uniform hypergraphs
• On tight 6-cycle decompositions of complete 3-uniform hypergraphs
• On tight 9-cycle decompositions of complete 3-uniform hypergraphs

Cited in

(6)

• A decomposition of complete bipartite \(4\)-uniform hypergraphs \(K_4^{5,5}\) into loose cycles of length \(5, 10\)
• On loose 4-cycle decompositions of complete 3-uniform hypergraphs
• 4-cycle decompositions of complete 3-uniform hypergraphs
• On tight 9-cycle decompositions of complete 3-uniform hypergraphs
• Maximum packings of the \(\lambda\)-fold complete 3-uniform hypergraph with loose 3-cycles
• On decompositions of complete 3-uniform hypergraphs into a linear forest with 4 edges

This page was built for publication:

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