Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543)

From MaRDI portal
Revision as of 23:21, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
scientific article

    Statements

    Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (English)
    0 references
    0 references
    0 references
    24 October 2011
    0 references
    Hamilton cycles
    0 references
    \(k\)-uniform hypergraph
    0 references

    Identifiers