Kings in \(k\)-partite tournaments (Q1185101)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Kings in \(k\)-partite tournaments |
scientific article; zbMATH DE number 37626
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kings in \(k\)-partite tournaments |
scientific article; zbMATH DE number 37626 |
Statements
Kings in \(k\)-partite tournaments (English)
0 references
28 June 1992
0 references
The authors show that every \(k\)-partite tournament with at most one node of indegree zero contains a node \(u\) such that the distance from \(u\) to any other node \(v\) is at most four.
0 references
kings
0 references
\(k\)-partite tournaments
0 references
