Excluding a line from complex-representable matroids
From MaRDI portal
Publication:6661171
DOI10.1090/memo/1523MaRDI QIDQ6661171
Zach Walsh, Peter Nelson, Jim Geelen
Publication date: 13 January 2025
Published in: Unnamed Author (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of points in a matroid with no \(n\)-point line as a minor
- Biased graphs. I: Bias, balance, and gains
- On linear systems with integral valued solutions
- Combinatorial geometries representable over GF(3) and GF(q). I: The number of points
- Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries
- Growth rates of minor-closed classes of matroids
- Algebraic characteristic sets of matroids
- The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics
- Biased graphs. II: The three matroids
- Graph minors. X: Obstructions to tree-decomposition
- Frame matroids and biased graphs
- Cliques in dense GF(\(q\))-representable matroids
- Biased graphs IV: Geometrical realizations
- The extremal functions of classes of matroids of bounded branch-width
- Branch-width and well-quasi-ordering in matroids and graphs.
- The integrality number of an integer program
- A density Hales-Jewett theorem for matroids
- The highly connected matroids in minor-closed classes
- Projective geometries in exponentially dense matroids. I.
- Matroids denser than a clique
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- When does a biased graph come from a group labelling?
- The structure of matroids with a spanning clique or projective geometry
- Obstructions to branch-decomposition of matroids
- A class of geometric lattices based on finite groups
- On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants
- Matroids Representable Over Fields With a Common Subfield
- Varieties of Combinatorial Geometries
- The densest matroids in minor-closed classes with exponential growth rate
- Menger's theorem for matroids
- On Matroids Representable over 𝐺𝐹(3) and Other Fields
- On the abstract properties of linear dependence.
This page was built for publication: Excluding a line from complex-representable matroids
