DOIAbstract
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of closed circuits
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of closed circuits
This paper generalizes a graph-theoretical result of Maffray to binary matroids. In particular, we p...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of clo...
AbstractIt is proved that, if M is a binary matroid, then every cocircuit of M has even cardinality ...
It is well known that a rank-r matroid M is uniquely determined by its circuits of size at most r. T...
This note gives a characterization of binary geometries by means of a double elimination axiom which...
AbstractIn an earlier paper we defined a class of matroids whose circuit are combinatorial generaliz...
AbstractWe prove that the class of C-matroids whose circuits intersect cocircuits on finite sets is ...
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answ...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
We verify a conjecture of P. Seymour (Europ. J. Combinatorics 2, p. 289) regarding circuits of a bin...
We study the circuit lattice of a binary matroid, i.e. the set of all integer linear combinations of...
AbstractWe verify a conjecture regarding circuits of a binary matroid. Acircuit coverof a integer-we...
This paper generalizes a graph-theoretical result of Maffray to binary matroids. In particular, we p...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of clo...
AbstractIt is proved that, if M is a binary matroid, then every cocircuit of M has even cardinality ...
It is well known that a rank-r matroid M is uniquely determined by its circuits of size at most r. T...
This note gives a characterization of binary geometries by means of a double elimination axiom which...
AbstractIn an earlier paper we defined a class of matroids whose circuit are combinatorial generaliz...
AbstractWe prove that the class of C-matroids whose circuits intersect cocircuits on finite sets is ...
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answ...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
We verify a conjecture of P. Seymour (Europ. J. Combinatorics 2, p. 289) regarding circuits of a bin...
We study the circuit lattice of a binary matroid, i.e. the set of all integer linear combinations of...
AbstractWe verify a conjecture regarding circuits of a binary matroid. Acircuit coverof a integer-we...
This paper generalizes a graph-theoretical result of Maffray to binary matroids. In particular, we p...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
Add to ORKG