首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Covering relations,closest orderings and hamiltonian bypaths in tournaments
Authors:Jeffrey S Banks  Georges Bordes  Michel Le Breton
Institution:(1) Departments of Economics and Political Science, University of Rochester, 14627 Rochester, NY, USA;(2) L.A.R.E., Faculté des Sciences économiques et de Gestion, Université de Bordeaux I, Avenue Léon Duguit, F-33604 Pessac Cédex, France;(3) GREQE, Université d'Aix-Marseille II et EHESS, 2, rue de la Charité, F-13002 Marseille, France
Abstract:We show that the Slater's set of a tournament, i.e. the set of the top elements of the closest orderings, is a subset of the top cycle of the uncovered set of the tournament. We also show that the covering relation is related to the hamiltonian bypaths of a strong tournament in that if x covers y, then there exists an hamiltonian bypath from x to y.We thank B. Monjardet and an anonymous editor for helpful suggestions.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号