AbstractLetF7denote the Fano matroid andMbe a simple connected binary matroid such that every cocircuit ofMhas size at leastd⩾3. We show that ifMdoes not have anF7-minor,M≠F*7, andd∉{5,6,7,8}, thenMhas a circuit of size at least min{r(M)+1,2d}. We conjecture that the latter result holds for alld⩾3
AbstractMurty, in 1971, characterized the connected binary matroids with all circuits having the sam...
A sufficiently large connected matroid M contains a big circuit or a big cocircuit. Wu showed that w...
We study the circuit lattice of a binary matroid, i.e. the set of all integer linear combinations of...
AbstractLetF7denote the Fano matroid andebe a fixed element ofF7. LetP(F7, e) be the family of matro...
AbstractLetF7denote the Fano matroid andMbe a simple connected binary matroid such that every cocirc...
We show that, for every integer k≥ 4 , if M is a k-connected matroid and C is a circuit of M such th...
We show that, for every integer k≥ 4 , if M is a k-connected matroid and C is a circuit of M such th...
We show that, for every integer k≥ 4 , if M is a k-connected matroid and C is a circuit of M such th...
We show that, for every integer k≥ 4 , if M is a k-connected matroid and C is a circuit of M such th...
AbstractIn 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the...
Abstract. This paper proves that a connected matroid M in which a largest circuit and a largest coci...
In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum...
This paper proves that a connected matroid M whose largest circuit and largest cocircuit have c and ...
Lovasz, Schrijver, and Seymour have shown that if a connected matroid M has a largest circuit of siz...
This paper proves that a connected matroid A/ in which a largest circuit and a largest cocircuit hav...
AbstractMurty, in 1971, characterized the connected binary matroids with all circuits having the sam...
A sufficiently large connected matroid M contains a big circuit or a big cocircuit. Wu showed that w...
We study the circuit lattice of a binary matroid, i.e. the set of all integer linear combinations of...
AbstractLetF7denote the Fano matroid andebe a fixed element ofF7. LetP(F7, e) be the family of matro...
AbstractLetF7denote the Fano matroid andMbe a simple connected binary matroid such that every cocirc...
We show that, for every integer k≥ 4 , if M is a k-connected matroid and C is a circuit of M such th...
We show that, for every integer k≥ 4 , if M is a k-connected matroid and C is a circuit of M such th...
We show that, for every integer k≥ 4 , if M is a k-connected matroid and C is a circuit of M such th...
We show that, for every integer k≥ 4 , if M is a k-connected matroid and C is a circuit of M such th...
AbstractIn 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the...
Abstract. This paper proves that a connected matroid M in which a largest circuit and a largest coci...
In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum...
This paper proves that a connected matroid M whose largest circuit and largest cocircuit have c and ...
Lovasz, Schrijver, and Seymour have shown that if a connected matroid M has a largest circuit of siz...
This paper proves that a connected matroid A/ in which a largest circuit and a largest cocircuit hav...
AbstractMurty, in 1971, characterized the connected binary matroids with all circuits having the sam...
A sufficiently large connected matroid M contains a big circuit or a big cocircuit. Wu showed that w...
We study the circuit lattice of a binary matroid, i.e. the set of all integer linear combinations of...
DOI
Add to ORKG