On the asymptotic proportion of connected matroids
From MaRDI portal
Publication:2275477
DOI10.1016/j.ejc.2011.01.016zbMath1244.05047OpenAlexW2134206798MaRDI QIDQ2275477
Dillon Mayhew, Geoffrey P. Whittle, Dominic J. A. Welsh, Michael W. Newman
Publication date: 9 August 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.01.016
Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of matroids and geometric lattices (05B35) Asymptotic enumeration (05A16)
Related Items (37)
A combinatorial formula for Kazhdan-Lusztig polynomials of sparse paving matroids ⋮ Matroids from hypersimplex splits ⋮ Positroids and non-crossing partitions ⋮ Matroids are not Ehrhart positive ⋮ On the number of matroids ⋮ Unnamed Item ⋮ The Merino-Welsh conjecture holds for series-parallel graphs ⋮ A method to construct all the paving matroids over a finite set ⋮ Doubly Exponentially Many Ingleton Matroids ⋮ Matroid relaxations and Kazhdan-Lusztig non-degeneracy ⋮ How many delta-matroids are there? ⋮ Ehrhart theory of paving and panhandle matroids ⋮ The Merino-Welsh conjecture for split matroids ⋮ Equivariant Kazhdan-Lusztig theory of paving matroids ⋮ Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor ⋮ Weighted exchange distance of basis pairs ⋮ Some inequalities for the Tutte polynomial ⋮ Exchange Distance of Basis Pairs in Split Matroids ⋮ Separable and equatable hypergraphs ⋮ The Tutte polynomial of some matroids ⋮ On the structure of the \(h\)-vector of a paving matroid ⋮ Asymptotics of symmetry in matroids ⋮ An entropy argument for counting matroids ⋮ On the number of matroids compared to the number of sparse paving matroids ⋮ List Coloring of Two Matroids through Reduction to Partition Matroids ⋮ Enumerating matroids of fixed rank ⋮ Inclusion of forbidden minors in random representable matroids ⋮ Counting matroids in minor-closed classes ⋮ Delta-matroids as subsystems of sequences of Higgs lifts ⋮ On the number of bases of almost all matroids ⋮ Complexity of packing common bases in matroids ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids ⋮ Coxeter submodular functions and deformations of Coxeter permutahedra ⋮ Matroid Theory for Algebraic Geometers ⋮ Secret sharing schemes for ports of matroids of rank 3 ⋮ Hypergraph characterization of split matroids ⋮ The number of partial Steiner systems and d-partitions
Cites Work
- A unique factorization theorem for matroids
- On the number of zero-patterns of a sequence of polynomials
- On Random Representable Matroids
- Small Submatroids in Random Matroids
- THRESHOLD FUNCTIONS FOR SOME PROPERTIES OF RANDOM SUBSETS OF PROJECTIVE SPACES
- A Catalogue of Combinatorial Geometries
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the asymptotic proportion of connected matroids
