Decomposition of the complete hypergraph into hyperclaws (Q1812635): Difference between revisions

Let \(K^ h_ n\) denote the complete hypergraph, i.e. the set of all \(h\)-subsets of an \(n\)-set. A delta-system \(\Delta(p,h,c)\) is a set of \(c\) edges of \(K^ h_ n\) such that there exists a \(p\)-set that is the intersection of any two of these edges. Continuing earlier work and work of \textit{S. Yamamoto} and \textit{S. Tazawa} [Ann. Discrete Math. 6, 385-391 (1980; Zbl 0458.05047)] the author gives necessary and sufficient conditions for \(K^ h_ n\) to be decomposable into edge-disjoint delta- sets for many triples \((p,h,c)\).