Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges (Q1715626)
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: Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges |
scientific article |
Statements
Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges (English)
0 references
29 January 2019
0 references
Hamilton cycles
0 references
asymptotic enumeration formula
0 references
0.9046409726142884
0 references
0.8758988976478577
0 references
0.8624684810638428
0 references
0.8605937957763672
0 references
0.8122982978820801
0 references
