Matroid packing/covering conjecture

Let $M$ and $N$ be tame matroids on the same ground set $E$. A packing for a pair of matroids on a set is a pair of disjoint spanning sets, one for each matroid, and a covering is a pair of independent sets, one in each matroid, whose union is the whole ground set. Matroid packing/covering conjecture. The ground set admits a partition

$$E=P\dot\cup Q$$

such that $(M\!\restriction_P,N\!\restriction_P)$ has a packing and $(M.Q,N.Q)$ has a covering. The conjecture unifies natural infinite analogues of the Base Packing and Base Covering theorems. The paper introduces it as a conjectural equivalent formulation of the matroid intersection conjecture; the supplied status is unknown, so it remains open in this database.