On cycles in multipartite tournaments (Q1325269)
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: On cycles in multipartite tournaments |
scientific article; zbMATH DE number 572453
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On cycles in multipartite tournaments |
scientific article; zbMATH DE number 572453 |
Statements
On cycles in multipartite tournaments (English)
0 references
24 May 1994
0 references
An \(n\)-partite tournament is an orientation of a complete \(n\)-partite graph. We show that if \(D\) is a strongly connected \(n\)-partite tournament, and if \(v\) is the only vertex in one of the partite sets of \(D\), then for any \(m\), \(3\leq m\leq n\), there is an \(m\)-cycle of \(D\) containing \(v\). This generalizes a theorem of Moon.
0 references
cycle
0 references
tournament
0 references
