On tournaments and their largest transitive subtournaments (Q1343231)
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 tournaments and their largest transitive subtournaments |
scientific article; zbMATH DE number 716419
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On tournaments and their largest transitive subtournaments |
scientific article; zbMATH DE number 716419 |
Statements
On tournaments and their largest transitive subtournaments (English)
0 references
1 February 1995
0 references
For each positive integer \(n\), let \(v(n)\) denote the largest integer such that every tournament of order \(n\) contains a transitive subtournament of order \(v(n)\). The author presents a quick survey of what is known about \(v(n)\). He then proves that there is a unique tournament of order 27 not containing a transitive tournament of order 6. He then goes on to show that every tournament of order 55 contains a transitive tournament of order 7.
0 references
tournament
0 references
transitive subtournament
0 references
transitive tournament
0 references
0.9547088
0 references
0.92732674
0 references
0.9235177
0 references
0.92186075
0 references
0.91025764
0 references
0.89749306
0 references
0.89506894
0 references
0.8866694
0 references
