Links between the Slater Index and the Ryser Index of Tournaments

Graphs and Combinatorics

Volumn 19, Issue 3, 2003, Pages 309-322

  Charon, Irène ^a   Hudry, Olivier ^a  

^a TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242360728     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-002-0510-z     Document Type: Article

References (20)

1. Barthélemy, J.-P., Monjardet, B.: The median procedure in cluster analysis and social choice theory. Math. Soc. Sci. 1, 235-267 (1981)
2. Bermond, J.-C.: Ordres à distance minimum d'un tournoi et graphes partiels sans circuits maximaux. Math. Sci. Hum. 37, 5-25 (1972)
3. Brualdi, R.A., Qiao, L.: Upsets in round robin tournaments. J. Comb. Theory, Ser. B 35, 62-77 (1983)
4. Brualdi, R.A., Qiao, L.: The interchange graph of tournaments with the same score vector. In: Progress in graph theory (pp. 129-151) Toronto: Academic Press 1984
5. Charon, I., Germa, A., Hudry, O.: Encadrement de l'indice de Slater d'un tournoi à l'aide de ses scores. Math. Inf. Sci. Hum. 118, 53-68 (1992)
6. Charon, I., Germa, A., Hudry, O.: Utilisation des scores dans des méthodes exactes déterminant les ordres médians des tournois. Math. Inf. Sci. Hum. 119, 53-74 (1992)
7. Charon, I., Guénoche, A., Hudry, O., Woirgard, F.: New results on the computation of median orders. Discrete Math. 165-166, 139-154 (1997)
8. Chartrand, G., Geller, D., Hedetniemi, S.: Graphs with forbidden subgraphs. J. Comb. Theory, Ser. B 10, 12-41 (1971)
9. de la Vega, W.F.: On the maximal cardinality of a consistent set of arcs in a random tournament. J. Comb. Theory, Ser. B 35, 328-332 (1983)
10. Fulkerson, D.R.: Upsets in round robin tournaments. Can. J. Math. 17, 957-969 (1965)
11. Guy, R.K.: A coarseness conjecture of Erdös. J. Comb. Theory 3, 38-42 (1967)
12. Laslier, J.-F.: Tournament solutions and majority voting. Berlin: Springer 1997
13. Moon, J.W.: Topics on tournaments. New York: Holt 1968
14. Monsuur, H., Storcken, T.: Measuring intransitivity. Math. Soc. Sci. 34, 125-152 (1997)
15. Poljak, S., Rödl, V., Spencer, J.: Tournament ranking with expected profit in polynomial time. SIAM J. Discrete Math. 1(3), 372-376 (1988)
16. Poljak, S., Turzik, D.: A polynomial time heuristic for certain subgraph optimization problems with guaranteed lower bound. Discrete Math. 58, 99-104 (1986)
17. Reid, K.B.: On set of arcs containing no cycles in tournaments. Can. Math. Bull. 12, 261-264 (1969)
18. Ryser, H.J.: Matrices of zeros and ones in combinatorial mathematics. In: Recent Advances in Matrix Theory (pp. 103-124) Madison: University of Wisconsin Press 1964
19. Slater, P.: Inconsistencies in a schedule of paired comparisons. Biometrika 48, 303-312 (1961)
20. Woirgard, F.: Recherche et dénombrement des ordres médians des tournois. Paris: PhD thesis (ENST) 1997