JCT
1998
13 years 4 months ago
1998
Given a tournament score sequence s1 ≥ s2 ≥ · · · ≥ sn, we prove that there exists a tournament T on vertex set {1, 2, . . . , n} such that the degree of any vertex i is ...
DM
2006
13 years 5 months ago
2006
Let n be a positive integer. A tournament is called n-existentially closed (or n-e.c.) if for every subset S of n vertices and for every subset T of S, there is a vertex x / S whi...
ATAL
2009
Springer
13 years 11 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...