The cycle structure of regular multipartite tournaments (Q1613369)
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: The cycle structure of regular multipartite tournaments |
scientific article; zbMATH DE number 1792317
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The cycle structure of regular multipartite tournaments |
scientific article; zbMATH DE number 1792317 |
Statements
The cycle structure of regular multipartite tournaments (English)
0 references
29 August 2002
0 references
A multipartite tournament is an orientation of a complete graph. A digraph is regular if the indegree and outdegree of every vertex equal the same constant. B. Alspach proved that every arc of a regular tournament is contained in a cycle of length \(n\) for \(n\in \{3,4,\dots, p\}\), where \(p\) is the order of the tournament. The authors prove an interesting extension of this theorem.
0 references
digraphs
0 references
multipartite tournament
0 references
cycles
0 references
regularity
0 references
0 references
