DOIAbstract
This note gives a characterization of binary geometries by means of a double elimination axiom which is a strengthening of the usual circuit elimination axiom used in defining matroids in general
This note gives a characterization of binary geometries by means of a double elimination axiom which is a strengthening of the usual circuit elimination axiom used in defining matroids in general
The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the c...
AbstractSymmetric matroids and their associated structure (delta matroids) are a generalization of f...
AbstractWe continue our previous study of the lattice (grid) generated by the incidence vectors of c...
This note gives a characterization of binary geometries by means of a double elimination axiom which...
AbstractWe introduce a new axiomatization of matroid theory that requires the elimination property o...
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of clo...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
AbstractMatroid coordinatizations over GF(3) are characterized by several properties, including a si...
AbstractIn an earlier paper we defined a class of matroids whose circuit are combinatorial generaliz...
AbstractIn hopes of better understanding graph-theoretic duality, a syntactical ‘duality principle’ ...
AbstractUsing an earlier characterization of simplicial hypergraphs we obtain a characterization of ...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
summary:We give an example of a class of binary matroids with a cocircuit partition and we give some...
AbstractAntimatroids generalize the notion of convexity in much the same way as matroids generalize ...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the c...
AbstractSymmetric matroids and their associated structure (delta matroids) are a generalization of f...
AbstractWe continue our previous study of the lattice (grid) generated by the incidence vectors of c...
This note gives a characterization of binary geometries by means of a double elimination axiom which...
AbstractWe introduce a new axiomatization of matroid theory that requires the elimination property o...
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of clo...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
AbstractMatroid coordinatizations over GF(3) are characterized by several properties, including a si...
AbstractIn an earlier paper we defined a class of matroids whose circuit are combinatorial generaliz...
AbstractIn hopes of better understanding graph-theoretic duality, a syntactical ‘duality principle’ ...
AbstractUsing an earlier characterization of simplicial hypergraphs we obtain a characterization of ...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
summary:We give an example of a class of binary matroids with a cocircuit partition and we give some...
AbstractAntimatroids generalize the notion of convexity in much the same way as matroids generalize ...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the c...
AbstractSymmetric matroids and their associated structure (delta matroids) are a generalization of f...
AbstractWe continue our previous study of the lattice (grid) generated by the incidence vectors of c...
Add to ORKG