Packing of \(K_{v}\) with certain graphs of five vertices (Q698025)

The packing number \(p(v,G)\) is the maximum number of edge-disjoint subgraphs isomorphic to \(G\) contained in the complete graph \(K_v\). The determination of \(p(v,G)\) has been given when \(G\) is a forest of five vertices by \textit{Y. Roditty} [The packing and covering of the complete graph. I: The forests of order five. Int. J. Math. Math. Sci. 9, 277-282 (1986; Zbl 0608.05028)] and by Ge when \(G\) is a star of five vertices plus one edge [\textit{G. Ge}, Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packing of \(K_n\), not yet published]. The paper under review gives the computation of \(p(v,G)\) for the remaining six graphs with five vertices, at most \(6\) edges and minimum degree \(1\). Each of this six graphs satisfies \(\lfloor v(v-1)/2e(G)\rfloor-1\leq p(v,G)\leq \lfloor v(v-1)/2e(G)\rfloor\) for all \(v\geq 5\).