Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations (Q289992)

Summary: Motivated by a 40-year-old problem due to \textit{P. J. Cameron} [Parallelisms of complete designs. Cambridge etc.: Cambridge University Press (1976; Zbl 0333.05007)] on extending partial parallelisms, we provide necessary and sufficient conditions under which one can extend an \(r\)-factorization of a complete \(3\)-uniform hypergraph on \(m\) vertices, \(K_m^3\), to an \(s\)-factorization of \(K_n^3\). This generalizes an existing result of \textit{ZS. Baranyai} and \textit{A. E. Brouwer} [Extension of colourings of the edges of a complete (uniform hyper) graph. Amsterdam: Math. Centrum (1977; Zbl 0362.05059)] -- where they proved it for the case \(r=s=1\). For Part I see [\textit{A. Bahmanian} and \textit{C. Rodger}, J. Graph Theory 73, No. 1--2, 216--224 (2013; Zbl 1264.05088)].