We characterize 2–dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer (Conjecture 3 of S. Maurer, Matroid basis graphs I, JCTB 14 (1973), 216–240). We also establish Conjecture 1 from the same paper about the redundancy of the conditions in the characterization of basis graphs. We indicate positive-curvature-like aspects of the local properties of the studied complexes. We characterize similarly the corresponding 2–dimensional complexes of even ∆–matroids
AbstractLet G be a 2-connected undirected graph with n vertices. Its connected subgraphs of n−1 edge...
Funding Information: Supported by DFG grant STU 563/4-1 “Noncrossing phenomena in Algebra and Geomet...
This thesis is a compendium of three studies on which matroids and convex geometry play a central ro...
International audienceOn two conjectures of Maurer concerning basis graphs of matroid
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...
AbstractSeveral graph-theoretic notions applied to matroid basis graphs in the preceding paper are n...
AbstractIn [On Mills's conjecture on matroids with many common bases, Discrete Math. 240 (2001) 271–...
Bergman complexes are polyhedral complexes associated to matroids. Faces of these complexes are cert...
A fundamental achievement in the theory of matroids is the Topological Representation Theorem which ...
AbstractLemos (Discrete Math. 240 (2001) 271–276) proved a conjecture of Mills (Discrete Math. 203 (...
AbstractThis paper discusses a certain graph, called the “dependence graph” (“the DPG”), that can be...
International audienceThis paper considers completions of tope graphs of COMs (complexes of oriented...
Thesis (Ph.D.)--University of Washington, 2016-08The f-vector of a simplicial complex is a fundament...
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and ...
AbstractLet G be a 2-connected undirected graph with n vertices. Its connected subgraphs of n−1 edge...
Funding Information: Supported by DFG grant STU 563/4-1 “Noncrossing phenomena in Algebra and Geomet...
This thesis is a compendium of three studies on which matroids and convex geometry play a central ro...
International audienceOn two conjectures of Maurer concerning basis graphs of matroid
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...
AbstractSeveral graph-theoretic notions applied to matroid basis graphs in the preceding paper are n...
AbstractIn [On Mills's conjecture on matroids with many common bases, Discrete Math. 240 (2001) 271–...
Bergman complexes are polyhedral complexes associated to matroids. Faces of these complexes are cert...
A fundamental achievement in the theory of matroids is the Topological Representation Theorem which ...
AbstractLemos (Discrete Math. 240 (2001) 271–276) proved a conjecture of Mills (Discrete Math. 203 (...
AbstractThis paper discusses a certain graph, called the “dependence graph” (“the DPG”), that can be...
International audienceThis paper considers completions of tope graphs of COMs (complexes of oriented...
Thesis (Ph.D.)--University of Washington, 2016-08The f-vector of a simplicial complex is a fundament...
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and ...
AbstractLet G be a 2-connected undirected graph with n vertices. Its connected subgraphs of n−1 edge...
Funding Information: Supported by DFG grant STU 563/4-1 “Noncrossing phenomena in Algebra and Geomet...
This thesis is a compendium of three studies on which matroids and convex geometry play a central ro...