Score sets in \(k\)-partite tournaments (Q854436)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5076948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Score sets in \(k\)-partite tournaments |
scientific article; zbMATH DE number 5076948 |
Statements
Score sets in \(k\)-partite tournaments (English)
0 references
4 December 2006
0 references
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.
0 references
Landau's criterion
0 references
0.9178715
0 references
0.89844626
0 references
0.8918885
0 references
0 references
0.88624656
0 references
0.88624644
0 references
