The number of connected sparsely edged uniform hypergraphs

@article{Karonski1997TheNO,
title={The number of connected sparsely edged uniform hypergraphs},
author={Michal Karonski and Tomasz Luczak},
journal={Discrete Mathematics},
year={1997},
volume={171},
pages={153-167}
}

Certain families of d-uniform hypergraphs are counted. In particular, the number of connected d-uniform hypergraphs with r vertices and r + k hyperedges, where k = o(log r/log tog r) , is found.