Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0012-365X(96)00076-3 | Discrete Mathematics |
Keywords | Field | DocType |
uniform hypergraphs | Discrete mathematics,Combinatorics,Vertex (geometry),Constraint graph,Mathematics | Journal |
Volume | Issue | ISSN |
171 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
7 | 0.65 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michał Karoński | 1 | 197 | 18.48 |
| Tomasz Łuczak | 2 | 225 | 40.26 |