AbstractAntimatroids generalize the notion of convexity in much the same way as matroids generalize the notion of linear dependence. Definitions and examples of antimatroids are presented. Rooted circuits of anitmatroids are defined, and a new characterization of antimatroids is given. This characterization involves a rooted circuit elimination property that is reminiscent of the matroid circuit elimination property
AbstractUsing the theory of the anti-exchange closure the structure of the lattice of convex sets of...
AbstractAn antimatroid is a family of sets such that it contains an empty set, and it is accessible ...
AbstractI extend two theorems of Edmonds concerning common independent vectors in two polymatroids. ...
Similarities and differences between matroids (abstract dependence systems) and antimatroids (abstra...
AbstractIn a matroid, (X,e) is a rooted circuit if X is a set not containing element e and X∪{e} is ...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
AbstractThe concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extens...
AbstractWe introduce a new axiomatization of matroid theory that requires the elimination property o...
AbstractMatroids are combinatorial abstractions of the linear hull operator; antimatroids, which are...
AbstractCharacterisations of symplectic and orthogonal Lagrangian matroids in terms of basis exchang...
AbstractAntimatroids are combinatorial structures abstracting some properties of convexity, and in a...
AbstractThe concept of a circuit basis for a matroid is introduced, as an algorithmically rapid way ...
AbstractWe consider matroidal structures on convex geometries, which we call cg-matroids. The concep...
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of clo...
AbstractWe generalize to oriented matroids classical notions of Convexity Theory: faces of convex po...
AbstractUsing the theory of the anti-exchange closure the structure of the lattice of convex sets of...
AbstractAn antimatroid is a family of sets such that it contains an empty set, and it is accessible ...
AbstractI extend two theorems of Edmonds concerning common independent vectors in two polymatroids. ...
Similarities and differences between matroids (abstract dependence systems) and antimatroids (abstra...
AbstractIn a matroid, (X,e) is a rooted circuit if X is a set not containing element e and X∪{e} is ...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
AbstractThe concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extens...
AbstractWe introduce a new axiomatization of matroid theory that requires the elimination property o...
AbstractMatroids are combinatorial abstractions of the linear hull operator; antimatroids, which are...
AbstractCharacterisations of symplectic and orthogonal Lagrangian matroids in terms of basis exchang...
AbstractAntimatroids are combinatorial structures abstracting some properties of convexity, and in a...
AbstractThe concept of a circuit basis for a matroid is introduced, as an algorithmically rapid way ...
AbstractWe consider matroidal structures on convex geometries, which we call cg-matroids. The concep...
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of clo...
AbstractWe generalize to oriented matroids classical notions of Convexity Theory: faces of convex po...
AbstractUsing the theory of the anti-exchange closure the structure of the lattice of convex sets of...
AbstractAn antimatroid is a family of sets such that it contains an empty set, and it is accessible ...
AbstractI extend two theorems of Edmonds concerning common independent vectors in two polymatroids. ...
DOI
Add to ORKG