Add to ORKGWe verify a conjecture of P. Seymour (Europ. J. Combinatorics 2, p. 289) regarding circuits of a binary matroid. A circuit cover of a integer-weighted matroid (M; p) is a list of circuits of M such that each element e is in exactly p(e) circuits from the list. We characterize those binary matroids for which two obvious necessary conditions for a weighting (M; p) to have a circuit cover are also sufficient
Abstract. In this paper, we propose a new type of matroids, namely covering matroids, and investigat...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answ...
AbstractWe verify a conjecture regarding circuits of a binary matroid. Acircuit coverof a integer-we...
In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M , the sum of the maxim...
AbstractIn 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the...
In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum...
We study the circuit lattice of a binary matroid, i.e. the set of all integer linear combinations of...
International audienceLas Vergnas & Hamidoune studied the number of circuits needed to determine an ...
Las Vergnas & Hamidoune studied the number of circuits needed to deter-mine an oriented matroid....
AbstractA cycle in a matroid is a disjoint union of circuits. This paper proves that every regular m...
AbstractMurty, in 1971, characterized the connected binary matroids with all circuits having the sam...
AbstractFor k = 2 and 3, we define several k-sums of binary matroids and of polytopes arising from c...
AbstractThe concept of a circuit basis for a matroid is introduced, as an algorithmically rapid way ...
AbstractIt is shown that each binary matroid contains an odd number of maximal cycles and, as a resu...
Abstract. In this paper, we propose a new type of matroids, namely covering matroids, and investigat...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answ...
AbstractWe verify a conjecture regarding circuits of a binary matroid. Acircuit coverof a integer-we...
In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M , the sum of the maxim...
AbstractIn 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the...
In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum...
We study the circuit lattice of a binary matroid, i.e. the set of all integer linear combinations of...
International audienceLas Vergnas & Hamidoune studied the number of circuits needed to determine an ...
Las Vergnas & Hamidoune studied the number of circuits needed to deter-mine an oriented matroid....
AbstractA cycle in a matroid is a disjoint union of circuits. This paper proves that every regular m...
AbstractMurty, in 1971, characterized the connected binary matroids with all circuits having the sam...
AbstractFor k = 2 and 3, we define several k-sums of binary matroids and of polytopes arising from c...
AbstractThe concept of a circuit basis for a matroid is introduced, as an algorithmically rapid way ...
AbstractIt is shown that each binary matroid contains an odd number of maximal cycles and, as a resu...
Abstract. In this paper, we propose a new type of matroids, namely covering matroids, and investigat...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answ...