Decomposition of the complete hypergraph into hyperclaws
From MaRDI portal
Publication:1812635
DOI10.1016/0012-365X(89)90307-5zbMath0747.05065MaRDI QIDQ1812635
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\) ⋮ Packing, covering and decomposing of a complete uniform hypergraph into delta-systems ⋮ Solution of a delta-system decomposition problem ⋮ Decomposition of the complete hypergraph into delta-systems. I
Cites Work
- Decomposition of the complete hypergraph into delta-systems. I
- Decomposition of the complete hypergraph into delta-systems. II
- On claw-decomposition of complete graphs and complete bigraphs
- Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini
- Extremal Results and Configuration Theorems for Steiner Systems
- Carres Siamois
- Hyperclaw Decomposition of Complete Hypergraphs
- Design of a new balanced file organization scheme with the least redundancy
- Some New 5-Designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Decomposition of the complete hypergraph into hyperclaws
