About a new class of matroid-inducing packing families Original Research Article

Let image be a family of graphs. A image-packing of a graph G is a subgraph of G, components of which are isomorphic to members of image. We are concerned with families image, such that in every graph G, the subsets of vertices that can be saturated by some image-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.