This paper extends the concept of paving from finite matroids to matroids of arbitrary cardinality. Afterwards, a paving matroid of arbitrary cardinality is characterized in terms of its collection of closed sets, independent sets, and circuits, respectively.
Citation
Hua Mao. Paving Matroids of Arbitrary Cardinality[J], Ars Combinatoria, Volume 090. 245-256. .