Asymptotic Enumeration of Non-Uniform Linear Hypergraphs

A linear hypergraph, also known as a partial Steiner system, is a collection of subsets of a set such that no two of the subsets have more than one element in common. Most studies of linear hypergraphs consider only the uniform case, in which all the subsets have the same size. In this paper we provide, for the first time, asymptotically precise estimates of the number of linear hypergraphs in the non-uniform case, as a function of the number of subsets of each size.