Polynomial-time perfect matchings in dense hypergraphs (Q5495801): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963068836 / rank
 
Normal rank

Latest revision as of 00:01, 20 March 2024

scientific article; zbMATH DE number 6326965
Language Label Description Also known as
English
Polynomial-time perfect matchings in dense hypergraphs
scientific article; zbMATH DE number 6326965

    Statements

    Polynomial-time perfect matchings in dense hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    7 August 2014
    0 references
    lattices
    0 references
    perfect matchings
    0 references

    Identifiers

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