Decomposition of the complete hypergraph into delta-systems. I (Q1073045): Difference between revisions

Denote by \(K^ h_ n\) all h-element subsets of an n-element set. Denote by \(\Delta\) (p,h,c) a delta-system of c pieces of an h-element set with a p-element kernel. \textit{S. Yamamoto} and \textit{S. Tazawa} [Hyperclaw decomposition of complete hypergraphs, Ann. Discrete Math. 6, 385-391 (1980; Zbl 0458.05047)] studied the problem of decomposing \(K^ h_ n\) into \(\Delta\) (h-1,h,c). In this paper the authors investigate the general decomposition problem, and prove the following theorem: If \(c{h\choose p}\) divides \({n-p\choose h-p}\) and if \(n\geq p+c(h-p){h\choose p}\) then \(K^ h_ n\) is decomposable into \(\Delta\) (p,h,c). The rest of the paper treats the regular decompositions into \(\Delta\) (1,h,c). (In this case every points of the ground set is the center of same number delta-systems.) Finally the authors study the special case of \(p=1\), \(h=3\).