Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor
From MaRDI portal
Publication:6117241
DOI10.37236/11946arXiv2111.11577OpenAlexW3215138631MaRDI QIDQ6117241
Publication date: 16 February 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.11577
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Enumeration in graph theory (05C30) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83) Asymptotic enumeration (05A16)
Cites Work
- Unnamed Item
- Unnamed Item
- An entropy argument for counting matroids
- On the number of matroids compared to the number of sparse paving matroids
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Enumerating matroids of fixed rank
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Asymptotics of symmetry in matroids
- On the number of bases of almost all matroids
- Counting matroids in minor-closed classes
- On the asymptotic proportion of connected matroids
- Lower bounds for constant weight codes
- On the number of linear hypergraphs of large girth
- An Extension of Mantel’s Theorem to k-Graphs
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
This page was built for publication: Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor
