Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges (Q1715626): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejc.2018.11.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJC.2018.11.002 / rank | |||
Normal rank | |||
Latest revision as of 05:44, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
