The number of connected sparsely edged uniform hypergraphs (Q1363695): Difference between revisions

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 \log r)\), is found.