Realizing Small Tournaments Through Few Permutations | Zendy

Christinan Eggermont | Zendy; C.A.J. Hurkens | Zendy; Gerard J. Woeginger | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Realizing Small Tournaments Through Few Permutations

Author(s) -

Christinan Eggermont,

C.A.J. Hurkens,

Gerard J. Woeginger

Publication year - 2013

Publication title -

acta cybernetica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.143

H-Index - 18

eISSN - 2676-993X

pISSN - 0324-721X

DOI - 10.14232/actacyb.21.2.2013.4

Subject(s) - tournament , combinatorics , relation (database) , permutation (music) , mathematics , property (philosophy) , parity of a permutation , discrete mathematics , computer science , cyclic permutation , data mining , symmetric group , physics , philosophy , epistemology , acoustics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research