The complexity of perfect matchings and packings in dense hypergraphs (Q2284737)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of perfect matchings and packings in dense hypergraphs
scientific article

    Statements

    The complexity of perfect matchings and packings in dense hypergraphs (English)
    0 references
    0 references
    0 references
    15 January 2020
    0 references
    perfect matching
    0 references
    absorbing method
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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