An r-uniform hypergraph H consists of a set vertices V and edges whose elements are r-subsets V. We define hypertree to be connected which contains no cycles. A spans if it is subhypergraph all H. Greenhill et al. (2017) gave an asymptotic formula for the average number spanning trees in graphs with given, sparse degree sequence. prove analogous result hypergraphs given sequence k=(k1,…,kn). Ou...
