Covering relations, closest orderings and Hamiltonian bypaths in tournaments

DOI10.1007/BF00183046zbMath0734.90027OpenAlexW2050887669MaRDI QIDQ811322

Georges Bordes, Jeffrey S. Banks, Michel Le Breton

Publication date: 1991

Published in: Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00183046

zbMATH Keywords

Hamiltonian bypathsSlater's set of a tournament

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Mathematical economics (91B99) Directed graphs (digraphs), tournaments (05C20) Social choice (91B14)

Related Items

Weak covering relations, The Copeland measure of Condorcet choice functions, New results on the computation of median orders, A survey on the linear ordering problem for weighted or unweighted tournaments, Condorcet choice correspondences: A set-theoretical comparison, An updated survey on the linear ordering problem for weighted or unweighted tournaments