Hyperclaw Decomposition of Complete Hypergraphs
From MaRDI portal
Publication:3907604
DOI10.1016/S0167-5060(08)70720-9zbMATH Open0458.05047OpenAlexW2201157476MaRDI QIDQ3907604FDOQ3907604
Authors: Sumiyasu Yamamoto, Shinsei Tazawa
Publication date: 1980
Published in: Combinatorial Mathematics, Optimal Designs and Their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70720-9
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (9)
- Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\)
- Decomposition of the complete hypergraph into hyperclaws
- Matchings and covers in hypergraphs
- Decomposition of large uniform hypergraphs
- Decompositions of hypergraphs into hyperstars
- Decomposition of the complete hypergraph into delta-systems. I
- On decomposition of hypergraphs into \(\Delta\)-systems
- Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
- Solution of a delta-system decomposition problem
This page was built for publication: Hyperclaw Decomposition of Complete Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3907604)