On the Maximum Packing Problem of $M{P}_{\lambda }(3,K_4^{(3)}–e,v)$

Abstract

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\ge 4$ and $\lambda$.