Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
From MaRDI portal
Publication:1205344
DOI10.1007/BF02351590zbMath0779.05031MaRDI QIDQ1205344
Publication date: 1 April 1993
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4, Delta-system decompositions of graphs, Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles, A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of the complete hypergraph into delta-systems. I
- Decompositions of hypergraphs into hyperstars
- On the decomposition of a graph into stars
- On claw-decomposition of complete graphs and complete bigraphs
- Decomposition of the complete hypergraph into hyperclaws
- Solution of a delta-system decomposition problem
- Hyperclaw Decomposition of Complete Hypergraphs