On matroids induced by packing subgraphs
Martin Loebl, Svatopluk Poljak · Journal of Combinatorial Theory Series A · 1987
Abstract The main result of the paper is a characterization of connected graphs H with the property: For any graph G, the subsets of vertices that can be saturated by packing edges of G and copies of H are independent sets of a matroid.