Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges (Q1715626): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963148305 / rank
 
Normal rank

Revision as of 19:52, 19 March 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
    0 references
    0 references
    29 January 2019
    0 references
    Hamilton cycles
    0 references
    asymptotic enumeration formula
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references