Score sets in \(k\)-partite tournaments
type: Item
instance of: scholarly article
title: Score sets in \(k\)-partite tournaments
zbMATH Open document ID: 1106.05043
DOI: 10.1007/BF02896474
author: T. A. Naikoo
author: Shariefuddin Pirzada
published in: Journal of Applied Mathematics and Computing
publication date: 2006-12-04T00:00:00Z
review text: The set of distinct scores (outdegrees) of the vertices of a \(k\)-partite tournament is called its score set. The paper shows that every set of \(n\) nonnegative integers, except \(\{0\}\) and \(\{0, 1\}\), is a score set of some 3-partite tournament, and that every set of \(n\) nonnegative integers is a score set of some \(k\)-partite tournament for every \(k\) bounded between \(n\) and 2.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 5076948
zbMATH Keywords: Landau's criterion
reviewed by: Wai-Kai Chen
MaRDI profile type: Publication
cites work: Q3927273
cites work: On score sets for tournaments
cites work: On the Score Sequence of an N-Partite Tournament
cites work: Q5585195
cites work: On score sets in tournaments
cites work: Q3682506
cites work: On Reid conjecture of score sets for tournaments
full work available at URL: https://doi.org/10.1007/bf02896474
OpenAlex ID: W2066495343
Recommended article: Q3478421
Recommended article: Q5395606
Recommended article: Q3171724
Recommended article: On Reid conjecture of score sets for tournaments
Recommended article: On the number of tournaments with prescribed score vector
Recommended article: Q4778308
Recommended article: On score sets in tournaments
Recommended article: On score sequences of \(k\)-hypertournaments
Recommended article: Q5313831
description: scientific article; zbMATH DE number 5076948