Transitive convex subsets in large tournaments

DOI10.1016/j.endm.2005.06.063zbMath1200.05093OpenAlexW1985488151MaRDI QIDQ3439377

Bertrand Jouve

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.063

zbMATH Keywords

majority votingconvex subsetstournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

The morphology of infinite tournaments; application to the growth of their profile ⋮ Convex circuit-free coloration of an oriented graph ⋮ Tournaments without acyclic interval.

Cites Work

• Tournament solutions and majority voting
• Unnamed Item

This page was built for publication: Transitive convex subsets in large tournaments