In this paper, we deal with a special kind of hypergraph decomposition. We show that there exists a decomposition of the 3-uniform hypergraph \(\lambda K_v^{(3)}\) into a special kind of hypergraph \(K_{4}^{(3)} – e\) whose leave has at most two edges, for any positive integers \(v \geq 4 \) and \(\lambda\).
Citation
Yan Wu, Yanxun Chang. On the Maximum Packing Problem of \(MP_{\lambda}(3, K_{4}^{(3)} – e, v)\)[J], Ars Combinatoria, Volume 113. 361-375. .