A method to construct all the paving matroids over a finite set

We give a characterization of paving matroids through their sets of hyperplanes and an algorithm to construct all of them. We also give a simple proof of Rota’s basis conjecture for the case of sparse-paving matroids and for the case of paving matroids of rank rr on a set of cardinality n≤2rn≤2r, an...

Full description

Saved in:
Bibliographic Details
Main Author: Mederos, Boris
Other Authors: Takane, Martha, Tapia Sanchez, Gustavo, Perez-Cabrera, Ivan, Zavala, Bertha
Format: Artículo
Published: 2022
Online Access:https://doi.org/10.1007/s40590-022-00440-9
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items