A 16-vertex tournament for which Banks set and Slater set are disjoint (Q1382278)
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 1133172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 16-vertex tournament for which Banks set and Slater set are disjoint |
scientific article; zbMATH DE number 1133172 |
Statements
A 16-vertex tournament for which Banks set and Slater set are disjoint (English)
0 references
2 June 1998
0 references
A Banks winner of a tournament \(T\) is the node of largest score in any maximal transitive subtournament of \(T\). A Slater winner of \(T\) is the node of largest score in any transitive tournament obtained from \(T\) by reversing the smallest possible number of arcs. The authors define a tournament with 16 nodes for which the Banks winners and the Slater winners are disjoint.
0 references
Banks winner
0 references
tournament
0 references
Slater winner
0 references
0.8892512917518616
0 references
0.8491241335868835
0 references
0.8008385896682739
0 references
0.7922629714012146
0 references
0.7516171336174011
0 references
