Packing without some pieces

Erd\H{o}s and Hanani proved that for every fixed integer $k\ge 2$, the complete graph $K_n$ can be almost completely packed with copies of $K_k$; that is, $K_n$ contains pairwise edge-disjoint copies of $K_k$ that cover all but an $o_n(1)$ fraction of its edges. Equivalently, elements of the set $\text{C}(k)$ of all red-blue edge colorings of $K_k$ can be used to almost completely pack every red-blue edge coloring of $K_n$. The following strengthening of the aforementioned Erd\H{o}s-Hanani result is considered. Suppose ${\text{C}}^{\mathrm{\prime }}\subset \text{C}(k)$. Is it true that we can use elements only from ${\text{C}}^{\mathrm{\prime }}$ and almost completely pack every red-blue edge coloring of $K_n$? An element $C\in \text{C}(k)$ is {\em avoidable} if ${\text{C}}^{\mathrm{\prime }}=\text{C}(k)\setminus C$ has this property and a subset $\mathcal{F}\subset \text{C}(k)$ is avoidable if ${\text{C}}^{\mathrm{\prime }}=\text{C}(k)\setminus \mathcal{F}$ has this property. It seems difficult to determine all avoidable graphs as well as all avoidable families. We prove some nontrivial sufficient conditions for avoidability. Our proofs imply, in particular, that (i) almost all elements of $\text{C}(k)$ are avoidable (ii) all Eulerian elements of $\text{C}(k)$ are avoidable and, in fact, the set of all Eulerian elements of $\text{C}(k)$ is avoidable.