On matroids induced by packing subgraphs (Q1109053)

The class of those connected graphs H is described such that in any graph the vertex set covered by vertex disjoint copies of H and edges form the independent sets of a matroid. The condition is that H is either critical or has a 1-factor, or, finally, it has a degree-one vertex and a vertex c such that for every \(x\neq c\), H-x has a 1-factor. The notion of economical matching is introduced and several, mostly known, results in general factor theory are proved.