On the asymptotic proportion of connected matroids (Q2275477): Difference between revisions

Random graphs and their properties are well studied, but very little is known about the asymptotic behavior of classes of matroids. The proportion of graphs on \(n\) vertices with non-trivial automorphism group tends to zero as \(n\) tends to infinity and this is true for labeled as well as unlabeled graphs. The authors conjecture that asymptotically almost every matroid has trivial automorphism group, is arbitrarily highly connected and is not representable over any field. A proof is provided for the fact that the proportion of \(n\)-labeled matroids that are connected is asymptotically at least \(1/2\). The proof even of this most likely not best possible bound is highly non-trivial and suggests that the conjectures formulated in the paper are challenging.