Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges (Q1715626)

From MaRDI portal
Revision as of 08:08, 26 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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