Name
Abstract | ||
|---|---|---|
Very little is known about the asymptotic behaviour of classes of matroids. We make a number of conjectures about such be- haviours. For example, we conjecture that asymptotically almost ev- ery matroid: has a trivial automorphism group; is arbitrarily highly connected; and, is not representable over any field. We prove one re- sult: The proportion of labeled n-element matroids that are connected is asymptotically at least 1/2. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.ejc.2011.01.016 | European Journal of Combinatorics |
Keywords | Field | DocType |
asymptotic proportion,n-element matroids,connected matroids,asymptotic behavior,trivial automorphism group | Matroid,Discrete mathematics,Automorphism group,Combinatorics,Graphic matroid,Conjecture,Asymptotic analysis,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 6 | 0195-6698 |
Citations | PageRank | References |
18 | 1.33 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dillon Mayhew | 1 | 102 | 18.63 |
| Mike Newman | 2 | 38 | 5.81 |
| Dominic Welsh | 3 | 23 | 1.92 |
| Geoff Whittle | 4 | 471 | 57.57 |