Realizing small tournaments through few permutations

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

Realizing small tournaments through few permutations

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

Research output: Contribution to journal › Article › Academic › peer-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 language	English
Pages (from-to)	267-271
Journal	Acta Cybernetica
Volume	21
Issue number	2
Publication status	Published - 2013

Cite this

@article{3e59d62d03f549f487963772a3f70e89,

title = "Realizing small tournaments through few permutations",

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.",

author = "C.E.J. Eggermont and C.A.J. Hurkens and G.J. Woeginger",

year = "2013",

language = "English",

volume = "21",

pages = "267--271",

journal = "Acta Cybernetica",

issn = "0324-721X",

publisher = "University of Szeged",

number = "2",

}

TY - JOUR

T1 - Realizing small tournaments through few permutations

AU - Eggermont, C.E.J.

AU - Hurkens, C.A.J.

AU - Woeginger, G.J.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

M3 - Article

VL - 21

SP - 267

EP - 271

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 2

ER -

Realizing small tournaments through few permutations

Abstract

Fingerprint

Cite this