A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Ordered matroids and regular independence systems
1996
Discrete Mathematics
Preserved Fulltext
We consider a class of matroids which we call ordered matroids. We show that these are the matroids of regular independence systems. (If E is a finite ordered set, a regular independence system on E is an independence system (E, F) with the following property: if A E 9 and a E A, then (A -{a}) U {e} E 9 for all e E E-A such that e <a.) We give a necessary and sufficient condition for a regular independence system to be a matroid. This condition is checkable with a linear number of calls to an
doi:10.1016/0012-365x(94)00352-j
fatcat:t5gu3ytes5bvxnscyns6ebmuum