A 16-vertex tournament for which Banks set and Slater set are disjoint

DOI10.1016/S0166-218X(97)88689-1zbMath0895.05027OpenAlexW4238032513MaRDI QIDQ1382278

Olivier Hudry, Frédéric Woirgard, Irène Charon

Publication date: 2 June 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

tournamentBanks winnerSlater winner

Mathematics Subject Classification ID

Group preferences (91B10) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Maximum distance between Slater orders and Copeland orders of tournaments ⋮ A tournament of order 14 with disjoint Banks and Slater sets ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Bounds on the disparity and separation of tournament solutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Slater's winners of a tournament may not be in the Banks set
• Sophisticated voting outcomes and agenda control
• Choosing from a tournament
• On Subtournaments of a Tournament

This page was built for publication: A 16-vertex tournament for which Banks set and Slater set are disjoint