Research Communication | Open Access
Volume 2021 | Communication ID 319
Volume 2021 | Communication ID 319
| About Index Slater of a tournament |
Abderrahim Boussairi, Imane Talbaoui
Received |
Accepted |
Published |
February 24, 2021 |
March 10, 2021 |
March 15, 2021 |
Abstract: Given an n-tournament T, the Slater index i(T) of a tournament T is the minimum number of arcs that must be reversed to make T transitive [1]. It is not easy to see that i(T) ≤(n(n-1))/4. However there is no known exact formula for the upper bound of i(T). We are presenting here some bounds of the Slater index ([2], [5]) and some variants ([3]) with the results related. References [1] Patrik Slater. Inconsistencies in a schedule of paired comparisons. Biometrika, 48(3/4):303-312, 1961. [2] Shohei Satake. A constructive solution to a problem of ranking tournaments. Discrete ...