A Method to construct all the Paving Matroids over a Finite Set

Abstract

We give a characterization of a matroid to be paving, through its set of hyperplanes and give an algorithm to construct all of them.

arXiv admin note: text overlap with arXiv:1502.01806

References in corpus (6)

• The category of matroids
• Sparse paving matroids, basis-exchange properties, and cyclic flats
• On the structure of the h-vector of a paving matroid
• An entropy argument for counting matroids
• Rota's Basis Conjecture holds asymptotically
• A Method to construct the Sparse-paving Matroids over a Finite Set