AbstractWe introduce a new axiomatization of matroid theory that requires the elimination property only among modular pairs of circuits, and we present a cryptomorphic phrasing thereof in terms of Crapo’s axioms for flats.This new point of view leads to a corresponding strengthening of the circuit axioms for oriented matroids
AbstractCharacterisations of symplectic and orthogonal Lagrangian matroids in terms of basis exchang...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
AbstractWe study the modular triples of circuits of a matroid and use them to characterize four type...
AbstractWe introduce a new axiomatization of matroid theory that requires the elimination property o...
This note gives a characterization of binary geometries by means of a double elimination axiom which...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractThe concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extens...
This paper studies axiom systems of supermatroids. Barnabei et al.'s base axioms concerning poset ma...
AbstractIn this paper, the basic properties of oriented matroids are examined. A topological represe...
AbstractMatroid coordinatizations over GF(3) are characterized by several properties, including a si...
Las Vergnas & Hamidoune studied the number of circuits needed to deter-mine an oriented matroid....
This paper deals with the question of completing a monotone increasing family of subsets to obtain t...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950...
AbstractCharacterisations of symplectic and orthogonal Lagrangian matroids in terms of basis exchang...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
AbstractWe study the modular triples of circuits of a matroid and use them to characterize four type...
AbstractWe introduce a new axiomatization of matroid theory that requires the elimination property o...
This note gives a characterization of binary geometries by means of a double elimination axiom which...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractThe concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extens...
This paper studies axiom systems of supermatroids. Barnabei et al.'s base axioms concerning poset ma...
AbstractIn this paper, the basic properties of oriented matroids are examined. A topological represe...
AbstractMatroid coordinatizations over GF(3) are characterized by several properties, including a si...
Las Vergnas & Hamidoune studied the number of circuits needed to deter-mine an oriented matroid....
This paper deals with the question of completing a monotone increasing family of subsets to obtain t...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950...
AbstractCharacterisations of symplectic and orthogonal Lagrangian matroids in terms of basis exchang...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
AbstractWe study the modular triples of circuits of a matroid and use them to characterize four type...
DOI
Add to ORKG