Sciweavers

JCT
1998
100views more  JCT 1998»
14 years 3 days ago
2-Partition-Transitive Tournaments
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 ...
Barry Guiduli, András Gyárfás...
DM
2006
81views more  DM 2006»
14 years 14 days ago
On an adjacency property of almost all tournaments
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...
Anthony Bonato, Kathie Cameron
ATAL
2009
Springer
14 years 7 months ago
On the complexity of schedule control problems for knockout tournaments
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 ...
Thuc Vu, Alon Altman, Yoav Shoham