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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q311573
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Klas Markström / rank
 
Normal rank

Revision as of 03:39, 13 February 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