Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees

Vladimir Blinovsky, Catherine Greenhill

A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\ge 3$,…