Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 08:20, 30 January 2024

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