On score sequences of \(k\)-hypertournaments (Q1590213)

From MaRDI portal
Revision as of 10:22, 3 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
On score sequences of \(k\)-hypertournaments
scientific article

    Statements

    On score sequences of \(k\)-hypertournaments (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2001
    0 references
    For a pair \((n,k)\) of natural numbers with \(n\geq k>1\), a \(k\)-hypertournament on \(n\) vertices is a pair \((V,A)\), where \(V\) is a set of vertices, \(|V|= n\), and \(A\) is a set of \(k\)-tuples of vertices, called arcs, such that for any \(k\)-subset \(S\) of \(V\), \(A\) contains exactly one of the \(k!\) \(k\)-tuples whose elements belong to \(S\). In particular, a 2-hypertournament is an (ordinary) tournament. The authors characterise score sequences of \(k\)-hypertournaments and, thus, generalise Landau's result for tournaments.
    0 references
    0 references
    hypertournament
    0 references
    tournament
    0 references
    score sequences
    0 references

    Identifiers