On two conjectures of Maurer concerning basis graphs of matroids
- Chalopin, Jérémie
- Chepoi, Victor
- Osajda, Damian
DOIAbstract
International audienceOn two conjectures of Maurer concerning basis graphs of matroid
International audienceOn two conjectures of Maurer concerning basis graphs of matroid
A theorem of Edmonds characterizes when a pair of matroids has a common basis. Enumerating the commo...
AbstractIn [On Mills's conjecture on matroids with many common bases, Discrete Math. 240 (2001) 271–...
International audienceWe present superfactorial and exponential lower bounds on the number of Hamilt...
We characterize 2–dimensional complexes associated canonically with basis graphs of matroids as simp...
AbstractA matroid may be defined as a collection of sets, called bases, which satisfy a certain exch...
AbstractA Δ-matroid is a collection B of subsets of a finite set I, called bases, not necessarily eq...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractSeveral graph-theoretic notions applied to matroid basis graphs in the preceding paper are n...
We prove that if a matroid M contains two disjoint bases (or, du-ally, if its ground set is the unio...
Let b(M) and c(M), respectively, be the number of bases and circuits of a matroid M. For any given m...
If G is a looped graph, then its adjacency matrix represents a binary matroid MA(G) on V (G). MA(G) ...
My research lies at the intersection of combinatorics, commutative algebra, and algebraic geometry. ...
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and ...
Let M be a simple matroid (= combinatorial geometry). On the bases of M we consider two matroids S(M...
AbstractLet B(M) denote the collection of bases of a matroid M. Truemper showed that if M1 and M2 ar...
A theorem of Edmonds characterizes when a pair of matroids has a common basis. Enumerating the commo...
AbstractIn [On Mills's conjecture on matroids with many common bases, Discrete Math. 240 (2001) 271–...
International audienceWe present superfactorial and exponential lower bounds on the number of Hamilt...
We characterize 2–dimensional complexes associated canonically with basis graphs of matroids as simp...
AbstractA matroid may be defined as a collection of sets, called bases, which satisfy a certain exch...
AbstractA Δ-matroid is a collection B of subsets of a finite set I, called bases, not necessarily eq...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractSeveral graph-theoretic notions applied to matroid basis graphs in the preceding paper are n...
We prove that if a matroid M contains two disjoint bases (or, du-ally, if its ground set is the unio...
Let b(M) and c(M), respectively, be the number of bases and circuits of a matroid M. For any given m...
If G is a looped graph, then its adjacency matrix represents a binary matroid MA(G) on V (G). MA(G) ...
My research lies at the intersection of combinatorics, commutative algebra, and algebraic geometry. ...
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and ...
Let M be a simple matroid (= combinatorial geometry). On the bases of M we consider two matroids S(M...
AbstractLet B(M) denote the collection of bases of a matroid M. Truemper showed that if M1 and M2 ar...
A theorem of Edmonds characterizes when a pair of matroids has a common basis. Enumerating the commo...
AbstractIn [On Mills's conjecture on matroids with many common bases, Discrete Math. 240 (2001) 271–...
International audienceWe present superfactorial and exponential lower bounds on the number of Hamilt...
Add to ORKG