Realizing small tournaments through few permutations

C.E.J. Eggermont, C.A.J. Hurkens, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
1 Downloads (Pure)

Abstract

Every tournament on 7 vertices is the majority relation of a 3-permutation profile, and there exist tournaments on 8 vertices that do not have this property. Furthermore every tournament on 8 or 9 vertices is the majority relation of a 5-permutation profile. Keywords: voting systems, digraph realization, extremal combinatorics.
Original languageEnglish
Pages (from-to)267-271
JournalActa Cybernetica
Volume21
Issue number2
Publication statusPublished - 2013

Fingerprint

Dive into the research topics of 'Realizing small tournaments through few permutations'. Together they form a unique fingerprint.

Cite this