About a new class of matroid-inducing packing families

Let TT be a family of graphs. A TT-packing of a graph G is a subgraph of G  , components of which are isomorphic to members of TT. We are concerned with families TT, such that in every graph G  , the subsets of vertices that can be saturated by some TT-packing form a collection of independent sets of a matroid. The main purpose of this paper is to introduce a new class of families with this property.