AbstractLemos (Discrete Math. 240 (2001) 271–276) proved a conjecture of Mills (Discrete Math. 203 (1999) 195–205): for two (k+1)-connected matroids whose symmetric difference between their collections of bases has size at most k, there is a matroid that is obtained from one of these matroids by relaxing n1 circuit-hyperplanes and from the other by relaxing n2 circuit-hyperplanes, where n1 and n2 are non-negative integers such that n1+n2⩽k. In this paper, we prove a similar result, where the hypothesis of the matroids being k-connected is replaced by the weaker hypothesis of being vertically k-connected
We prove that if a matroid M contains two disjoint bases (or, du-ally, if its ground set is the unio...
AbstractMurty, in 1971, characterized the connected binary matroids with all circuits having the sam...
This paper proves that a connected matroid M whose largest circuit and largest cocircuit have c and ...
AbstractIn [On Mills's conjecture on matroids with many common bases, Discrete Math. 240 (2001) 271–...
AbstractLet B(M) denote the collection of bases of a matroid M. Truemper showed that if M1 and M2 ar...
AbstractIn this paper, we shall prove a conjecture of Mills: for two (k+1)-connected matroids whose ...
AbstractLet B(M) denote the collection of bases of a matroid M. Truemper showed that if M1 and M2 ar...
Quirk and Seymour have shown that a connected simple graph has at least as many spanning trees as ci...
AbstractM1=(E,F1) and M2=(E,F2) are two simple matroids on the same set E. We assume that M1 and M2 ...
AbstractLet G be a 2-connected undirected graph with n vertices. Its connected subgraphs of n−1 edge...
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and ...
AbstractSmith conjectured that two distinct longest cycles of a k-connected graph meet in at least k...
International audienceLas Vergnas & Hamidoune studied the number of circuits needed to determine an ...
AbstractWe extend to matroids Smith's Conjecture that any two distinct longest cycles of a k-connect...
AbstractLemos and Oxley proved that if M is a connected matroid with |E(M)|⩾3r(M), then M has a circ...
We prove that if a matroid M contains two disjoint bases (or, du-ally, if its ground set is the unio...
AbstractMurty, in 1971, characterized the connected binary matroids with all circuits having the sam...
This paper proves that a connected matroid M whose largest circuit and largest cocircuit have c and ...
AbstractIn [On Mills's conjecture on matroids with many common bases, Discrete Math. 240 (2001) 271–...
AbstractLet B(M) denote the collection of bases of a matroid M. Truemper showed that if M1 and M2 ar...
AbstractIn this paper, we shall prove a conjecture of Mills: for two (k+1)-connected matroids whose ...
AbstractLet B(M) denote the collection of bases of a matroid M. Truemper showed that if M1 and M2 ar...
Quirk and Seymour have shown that a connected simple graph has at least as many spanning trees as ci...
AbstractM1=(E,F1) and M2=(E,F2) are two simple matroids on the same set E. We assume that M1 and M2 ...
AbstractLet G be a 2-connected undirected graph with n vertices. Its connected subgraphs of n−1 edge...
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and ...
AbstractSmith conjectured that two distinct longest cycles of a k-connected graph meet in at least k...
International audienceLas Vergnas & Hamidoune studied the number of circuits needed to determine an ...
AbstractWe extend to matroids Smith's Conjecture that any two distinct longest cycles of a k-connect...
AbstractLemos and Oxley proved that if M is a connected matroid with |E(M)|⩾3r(M), then M has a circ...
We prove that if a matroid M contains two disjoint bases (or, du-ally, if its ground set is the unio...
AbstractMurty, in 1971, characterized the connected binary matroids with all circuits having the sam...
This paper proves that a connected matroid M whose largest circuit and largest cocircuit have c and ...