The number of partial Steiner systems and $d$-partitions

Abstract

We prove asymptotic upper bounds on the number of $d$-partitions (paving matroids of fixed rank) and partial Steiner systems (sparse paving matroids of fixed rank), using a mixture of entropy counting, sparse encoding, and the probabilistic method.

Journal version; article is now published in Advances in Combinatorics