Abstract
We study families of graphs T with the property: for any graph G, the subsets of V(G) that can be saturated by packing copies of graphs from T form a matroid. We extend the work of Loebl and Poljak on families containing edge, hypomatchable graphs and propellers.