Discrete Mathematics ( IF 0.770 ) Pub Date : 2020-10-16 , DOI: 10.1016/j.disc.2020.112192 Haya S. Aldosari; Catherine Greenhill
An -uniform hypergraph consists of a set of vertices and a set of edges whose elements are -subsets of . We define a hypertree to be a connected hypergraph which contains no cycles. A hypertree spans a hypergraph if it is a subhypergraph of which contains all vertices of . Greenhill et al. (2017) gave an asymptotic formula for the average number of spanning trees in graphs with given, sparse degree sequence. We prove an analogous result for -uniform hypergraphs with given degree sequence . Our formula holds when , where is the average degree and is the maximum degree.