A 16-vertex tournament for which Banks set and Slater set are disjoint (Q1382278): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Sophisticated voting outcomes and agenda control / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5650707 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4339963 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Slater's winners of a tournament may not be in the Banks set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4339962 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Subtournaments of a Tournament / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Choosing from a tournament / rank | |||
Normal rank | |||
Revision as of 10:48, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 16-vertex tournament for which Banks set and Slater set are disjoint |
scientific article |
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
