The number of connected sparsely edged uniform hypergraphs (Q1363695): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Tomasz Łuczak / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Edgar M. Palmer / rank | |||
Revision as of 09:47, 10 February 2024
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
