Solution of a delta-system decomposition problem
From MaRDI portal
Publication:1813980
DOI10.1016/0097-3165(90)90045-XzbMath0742.05067MaRDI QIDQ1813980
Publication date: 25 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4 ⋮ Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles ⋮ Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition of the complete hypergraph into delta-systems. I
- Decomposition of the complete hypergraph into delta-systems. II
- Decompositions of hypergraphs into hyperstars
- On claw-decomposition of complete graphs and complete bigraphs
- Decomposition of the complete hypergraph into hyperclaws
- Hyperclaw Decomposition of Complete Hypergraphs
This page was built for publication: Solution of a delta-system decomposition problem