Title

On properties of almost all matroids

Document Type

Article

Publication Date

1-1-2013

Abstract

We give several results about the asymptotic behaviour of matroids. Specifically, almost all matroids are simple and cosimple and, indeed, are 3-connected. This verifies a strengthening of a conjecture of Mayhew, Newman, Welsh, and Whittle. We prove several quantitative results including giving bounds on the rank, a bound on the number of bases, the number of circuits, and the maximum circuit size of almost all matroids. © 2012 Elsevier Inc.

Publication Source (Journal or Book title)

Advances in Applied Mathematics

First Page

115

Last Page

124

This document is currently not available here.

Share

COinS