Pages that link to "Item:Q1394344"
From MaRDI portal
The following pages link to The asymptotic number of geometries (Q1394344):
Displaying 23 items.
- On the number of matroids (Q313452) (← links)
- An entropy argument for counting matroids (Q462939) (← links)
- Random matroids (Q1220516) (← links)
- The dependence graph for bases in matroids (Q1241754) (← links)
- On the problem of approximating the number of bases of a matroid (Q1321827) (← links)
- Gross substitutability: an algorithmic survey (Q1682734) (← links)
- How many delta-matroids are there? (Q1686257) (← links)
- Antimatroids induced by matchings (Q1730258) (← links)
- On the number of bases of almost all matroids (Q1786054) (← links)
- Enumeration of extensions of the cycle matroid of a complete graph (Q2133994) (← links)
- A method to construct all the paving matroids over a finite set (Q2155830) (← links)
- On the complex-representable excluded minors for real-representability (Q2173426) (← links)
- Counting matroids in minor-closed classes (Q2259858) (← links)
- Coxeter submodular functions and deformations of Coxeter permutahedra (Q2308296) (← links)
- Matroids from hypersimplex splits (Q2363366) (← links)
- Enumerating matroids and linear spaces (Q2683212) (← links)
- Positroids and non-crossing partitions (Q3448990) (← links)
- The number of polytopes, configurations and real matroids (Q3718727) (← links)
- Tight Approximation for Unconstrained XOS Maximization (Q5026453) (← links)
- Approximation Limitations of Pure Dynamic Programming (Q5216795) (← links)
- Secret sharing schemes for ports of matroids of rank 3 (Q5858541) (← links)
- Representability of orthogonal matroids over partial fields (Q6119496) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)