The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree (Q1933645)

From MaRDI portal
Revision as of 00:44, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree
scientific article

    Statements

    The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree (English)
    0 references
    24 January 2013
    0 references
    0 references

    Identifiers

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