Excluding a line from complex-representable matroids
From MaRDI portal
Cites work
- A class of geometric lattices based on finite groups
- A density Hales-Jewett theorem for matroids
- Algebraic characteristic sets of matroids
- Biased graphs IV: Geometrical realizations
- Biased graphs. I: Bias, balance, and gains
- Biased graphs. II: The three matroids
- Branch-width and well-quasi-ordering in matroids and graphs.
- Cliques in dense GF(\(q\))-representable matroids
- 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
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Frame matroids and biased graphs
- Graph minors. X: Obstructions to tree-decomposition
- Growth rates of minor-closed classes of matroids
- scientific article; zbMATH DE number 3133252 (Why is no real title available?)
- scientific article; zbMATH DE number 475579 (Why is no real title available?)
- scientific article; zbMATH DE number 952954 (Why is no real title available?)
- scientific article; zbMATH DE number 4114646 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 3351601 (Why is no real title available?)
- Matroids denser than a clique
- Matroids representable over fields with a common subfield
- Menger's theorem for matroids
- Obstructions to branch-decomposition of matroids
- On linear systems with integral valued solutions
- On Matroids Representable over 𝐺𝐹(3) and Other Fields
- On the abstract properties of linear dependence.
- On the number of distinct rows of a matrix with bounded subdeterminants
- Projective geometries in exponentially dense matroids. I.
- The densest matroids in minor-closed classes with exponential growth rate
- The extremal functions of classes of matroids of bounded branch-width
- The highly connected matroids in minor-closed classes
- The integrality number of an integer program
- The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics
- The number of points in a matroid with no \(n\)-point line as a minor
- The structure of matroids with a spanning clique or projective geometry
- Varieties of Combinatorial Geometries
- When does a biased graph come from a group labelling?
Cited in
(2)
This page was built for publication: Excluding a line from complex-representable matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661171)
