Realizing small tournaments through few permutations

DOI10.14232/ACTACYB.21.2.2013.4MaRDI QIDQ5414486zbMATH OpenOpenAlexFDO

Authors Christian E. J. Eggermont, Gerhard J. Woeginger, Cor Hurkens

Publication date 5 May 2014

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/af55b29ca5d8babc7db54bd9487e80985e03f944

zbMATH Keywords

digraph realizationextremal combinatoricsvoting systems

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal combinatorics (05D99)

Recommendations

• Acyclic sets in k-majority tournaments
• Dominating sets in \(k\)-majority tournaments.
• On tournaments free of large transitive subtournaments
• A recurrence for bounds on dominating sets in k-majority tournaments
• scientific article; zbMATH DE number 3884197

Cited in

(2)

• On tournaments of small orders and their applications
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters

This page was built for publication: Realizing small tournaments through few permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5414486)