The number of connected sparsely edged uniform hypergraphs (Q1363695)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The number of connected sparsely edged uniform hypergraphs |
scientific article; zbMATH DE number 1047085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of connected sparsely edged uniform hypergraphs |
scientific article; zbMATH DE number 1047085 |
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
0.8521432280540466
0 references
0.8331206440925598
0 references
0.8235200643539429
0 references
0.8203064799308777
0 references
0.8044427633285522
0 references
