Name
Abstract | ||
|---|---|---|
Let sp(n) be the number of sparse paving matroids on the ground set {1,...,n}. We prove that loglogsp(n)=n-(3/2)logn+O(loglogn), and we conjecture that the same equality applies to the number of all matroids on the set {1,...,n}. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.aam.2011.07.004 | Advances in Applied Mathematics |
Keywords | Field | DocType |
sparse paving matroids,ground set,asymptotic,matroids,enumeration | Matroid,Discrete mathematics,Combinatorics,Enumeration,Graphic matroid,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
50 | 1 | 0196-8858 |
Citations | PageRank | References |
5 | 0.59 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dillon Mayhew | 1 | 102 | 18.63 |
| Dominic Welsh | 2 | 23 | 1.92 |