New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (Q4500484)

From MaRDI portal
scientific article; zbMATH DE number 1495915
Language Label Description Also known as
English
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
scientific article; zbMATH DE number 1495915

    Statements

    0 references
    23 January 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    matchings in hypergraphs
    0 references
    codegree sequence
    0 references
    Rödl nibble
    0 references
    polynomial method
    0 references
    strong concentration
    0 references
    0 references
    New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (English)
    0 references