AbstractWe 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 ∈ F and a ∈ A, then (A − {a}) ⌣ {e} ∈ F for all 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 independence oracle. With this condition we rediscover some known results relating regular 0/1 polytopes and matroids
AbstractLet G=(V, E) be a graph and let L(G) be the set of stable sets of G. The matroidal number of...
AbstractGiven a matroid M on E and a nonnegative real vector x=(xj:j∈E), a fundamental problem is to...
AbstractIt is proved that every regular matroid may be constructed by piecing together graphic and c...
AbstractWe consider a class of matroids which we call ordered matroids. We show that these are the m...
AbstractBy generalizing matroid axiomatics we provide a framework in which independence systems may ...
AbstractMotivated by the rank-axiomatic definitions of a matroid and Woodall's characterization of i...
AbstractThe problem of decomposing an independence system into the set-theoretic union of matroids i...
AbstractGiven a finite subset E of a vector space of dimension 4, the number of k-independent subset...
AbstractWe characterize the matroid dual to a transversal matroid. We also show that Richard Rado's ...
peer reviewedAn independence system Σ=(X, F) is called bimatroidal if there exist two matroids M=(X,...
AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered s...
AbstractIn the present paper we investigate properties of a general notion of independence and we us...
AbstractThose independence systems on finite partially ordered sets are characterized for which the ...
AbstractThis paper discusses a certain graph, called the “dependence graph” (“the DPG”), that can be...
AbstractThe main result of this paper can be quickly described as follows. Let G be a bipartite grap...
AbstractLet G=(V, E) be a graph and let L(G) be the set of stable sets of G. The matroidal number of...
AbstractGiven a matroid M on E and a nonnegative real vector x=(xj:j∈E), a fundamental problem is to...
AbstractIt is proved that every regular matroid may be constructed by piecing together graphic and c...
AbstractWe consider a class of matroids which we call ordered matroids. We show that these are the m...
AbstractBy generalizing matroid axiomatics we provide a framework in which independence systems may ...
AbstractMotivated by the rank-axiomatic definitions of a matroid and Woodall's characterization of i...
AbstractThe problem of decomposing an independence system into the set-theoretic union of matroids i...
AbstractGiven a finite subset E of a vector space of dimension 4, the number of k-independent subset...
AbstractWe characterize the matroid dual to a transversal matroid. We also show that Richard Rado's ...
peer reviewedAn independence system Σ=(X, F) is called bimatroidal if there exist two matroids M=(X,...
AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered s...
AbstractIn the present paper we investigate properties of a general notion of independence and we us...
AbstractThose independence systems on finite partially ordered sets are characterized for which the ...
AbstractThis paper discusses a certain graph, called the “dependence graph” (“the DPG”), that can be...
AbstractThe main result of this paper can be quickly described as follows. Let G be a bipartite grap...
AbstractLet G=(V, E) be a graph and let L(G) be the set of stable sets of G. The matroidal number of...
AbstractGiven a matroid M on E and a nonnegative real vector x=(xj:j∈E), a fundamental problem is to...
AbstractIt is proved that every regular matroid may be constructed by piecing together graphic and c...