The number of connected sparsely edged uniform hypergraphs (Q1363695)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of connected sparsely edged uniform hypergraphs |
scientific article |
Statements
The number of connected sparsely edged uniform hypergraphs (English)
0 references
10 November 1997
0 references
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.
0 references
hypergraphs
0 references
0 references
