Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs (Q2656703)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
scientific article

    Statements

    Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs (English)
    0 references
    0 references
    16 March 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    uniform hypergraphs
    0 references
    perfect matching decomposition
    0 references
    Hamilton tight decomposition
    0 references
    0 references