Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (Q5419939)

From MaRDI portal
Revision as of 05:28, 24 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6302961
Language Label Description Also known as
English
Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
scientific article; zbMATH DE number 6302961

    Statements

    Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (English)
    0 references
    0 references
    0 references
    11 June 2014
    0 references
    decision problem
    0 references

    Identifiers