On score sequences of \(k\)-hypertournaments
type: Item
instance of: scholarly article
title: On score sequences of \(k\)-hypertournaments
zbMATH Open document ID: 0966.05037
author: Guofel Zhou
author: Tianxing Yao
author: Keming Zhang
published in: European Journal of Combinatorics
publication date: 2001-08-16T00:00:00Z
review text: 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.
reviewed by: G. Gutin
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 1545622
zbMATH Keywords: hypertournament
zbMATH Keywords: tournament
zbMATH Keywords: score sequences
MaRDI profile type: Publication
full work available at URL: eujc.2000.0393
OpenAlex ID: W1989301087
cites work: Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments)
cites work: A generalization of rotational tournaments
cites work: What must be contained in every oriented k-uniform hypergraph
cites work: Hamiltonian paths and cycles in hypertournaments
cites work: The Theory of Round Robin Tournaments
DOI: 10.1006/EUJC.2000.0393
description: scientific article; zbMATH DE number 1545622