summary:We give an example of a class of binary matroids with a cocircuit partition and we give some characteristics of a set of cocircuits of such binary matroids which forms a partition of the ground set
AbstractOxley has shown that if, for some k ⩾ 4, a matroid M has a k-element set that is the interse...
We give an excluded-minor characterization for the class of matroids M in which M {set minus} e or M...
Fournier has characterized binary materials in terms of a certain circuit exchange property. This pa...
summary:We give an example of a class of binary matroids with a cocircuit partition and we give some...
AbstractIt is proved that, if M is a binary matroid, then every cocircuit of M has even cardinality ...
AbstractMurty, in 1971, characterized the connected binary matroids with all circuits having the sam...
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...
AbstractA proof is given of the result about binary matroids that implies that a connected graph is ...
AbstractA cocircuit of a matroid is separating if deleting it leaves a separable matroid. We give an...
We show that, for every positive integer c*, there is an integer n such that, if M is a matroid whos...
AbstractWe verify a conjecture regarding circuits of a binary matroid. Acircuit coverof a integer-we...
This paper extends the many different characterizations of finite binary matroids to finitary and co...
AbstractThe concept of a circuit basis for a matroid is introduced, as an algorithmically rapid way ...
AbstractThe number of disjoint cocircuits in a matroid is bounded by its rank. There are, however, m...
AbstractOxley has shown that if, for some k ⩾ 4, a matroid M has a k-element set that is the interse...
We give an excluded-minor characterization for the class of matroids M in which M {set minus} e or M...
Fournier has characterized binary materials in terms of a certain circuit exchange property. This pa...
summary:We give an example of a class of binary matroids with a cocircuit partition and we give some...
AbstractIt is proved that, if M is a binary matroid, then every cocircuit of M has even cardinality ...
AbstractMurty, in 1971, characterized the connected binary matroids with all circuits having the sam...
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...
AbstractA proof is given of the result about binary matroids that implies that a connected graph is ...
AbstractA cocircuit of a matroid is separating if deleting it leaves a separable matroid. We give an...
We show that, for every positive integer c*, there is an integer n such that, if M is a matroid whos...
AbstractWe verify a conjecture regarding circuits of a binary matroid. Acircuit coverof a integer-we...
This paper extends the many different characterizations of finite binary matroids to finitary and co...
AbstractThe concept of a circuit basis for a matroid is introduced, as an algorithmically rapid way ...
AbstractThe number of disjoint cocircuits in a matroid is bounded by its rank. There are, however, m...
AbstractOxley has shown that if, for some k ⩾ 4, a matroid M has a k-element set that is the interse...
We give an excluded-minor characterization for the class of matroids M in which M {set minus} e or M...
Fournier has characterized binary materials in terms of a certain circuit exchange property. This pa...
DOI
Add to ORKG