A Method to construct the Sparse-paving Matroids over a Finite Set

MaRDI QIDQ6258843zbMATH OpenFDO

Authors Boris Mederos, Martha Takane, G. Tapia Sánchez, B. Zavala

Publication date 6 February 2015

Abstract: In this work we present an algorithm to construct sparse-paving matroids over finite set $S$. From this algorithm we derive some useful bounds on the cardinality of the set of circuits of any Sparse-Paving matroids which allow us to prove in a simple way an asymptotic relation between the class of Sparse-paving matroids and the whole class of matroids. Additionally we introduce a matrix based method which render an explicit partition of the $r$-subsets of $S$, $$ such that each $mathcal{U}_i$ defines a sparse-paving matroid of rank $r$.

This page was built for publication: A Method to construct the Sparse-paving Matroids over a Finite Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6258843)