Minors of matroids represented by sparse random matrices over finite fields
From MaRDI portal
Combinatorial aspects of matroids and geometric lattices (05B35) Random graphs (graph-theoretic aspects) (05C80) Graph minors (05C83) Random matrices (algebraic aspects) (15B52) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)
Cites work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Almost all matroids are nonrepresentable
- Asymptotic properties of random subsets of projective spaces
- Encores on cores
- Growth rates of minor-closed classes of matroids
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Inclusion of forbidden minors in random representable matroids
- Minors of a random binary matroid
- On properties of almost all matroids
- On Random Representable Matroids
- On random subsets of projective spaces
- On the asymptotic proportion of connected matroids
- On the connectivity of random subsets of projective spaces
- On the number of bases of almost all matroids
- On the number of matroids
- Projective geometries in dense matroids
- Small Submatroids in Random Matroids
- Strictly balanced submatroids in random subsets of projective geometries
- The asymptotic number of geometries
- The rank of sparse random matrices
- The satisfiability threshold for random linear equations
- The Structure of a Random Graph at the Point of the Phase Transition
- THRESHOLD FUNCTIONS FOR SOME PROPERTIES OF RANDOM SUBSETS OF PROJECTIVE SPACES
This page was built for publication: Minors of matroids represented by sparse random matrices over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869639)
