The number of rank-k flats in a matroid with no U₂, n-minor
From MaRDI portal
Publication:403369
Abstract: We show that, if and are positive integers and is sufficiently large, then the number of rank- flats in a rank- matroid with no -minor is less than or equal to number of rank- flats in a rank- projective geometry over GF, where is the largest prime power not exceeding .
Recommendations
- Matroids with no \(U_{2,n}\)-minor and many hyperplanes
- The number of lines in a matroid with no \(U_{2,n}\)-minor
- On minimal non-orientable matroids with 2n elements and rank n
- The smallest matroids with no large independent flat
- The number of points in a matroid with no \(n\)-point line as a minor
- scientific article; zbMATH DE number 1916663
- k-plane matroids and Whiteley's flattening conjectures
- Amalgams of extremal matroids with no \(U_{2,\ell +2}\)-minor
- Sizes of flats of cycle matroids of complete graphs
- Matroids with no \((q+2)\)-point-line minors
Cites work
Cited in
(10)- Matroids with no \(U_{2,n}\)-minor and many hyperplanes
- The smallest matroids with no large independent flat
- Counting matroids in minor-closed classes
- A density Hales-Jewett theorem for matroids
- Maximum-sized matroids with no minors isomorphic to \(U_{2,5}\), \(F_7\), \(F_7^-\), or \(P_7\)
- On zeros of the characteristic polynomial of matroids of bounded tree-width
- The number of lines in a matroid with no \(U_{2,n}\)-minor
- The number of points in a matroid with no \(n\)-point line as a minor
- Sizes of flats of cycle matroids of complete graphs
- Amalgams of extremal matroids with no \(U_{2,\ell +2}\)-minor
This page was built for publication: The number of rank-\(k\) flats in a matroid with no \(U_{2, n}\)-minor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403369)