A Constructive Solution to a Tournament Problem
Canadian mathematical bulletin, Tome 14 (1971) no. 1, pp. 45-48
Voir la notice de l'article provenant de la source Cambridge
By a tournament Tn on n vertices, we shall mean a directed graph on n vertices for which every pair of distinct vertices form the endpoints of exactly one directed edge (e.g., see [5]). If x and y are vertices of Tn we say that x dominates y if the edge between x and y is directed from x to y. In 1962, K. Schütte [2] raised the following question: Given k > 0, is there a tournament Tn(k) such that for any set S of k vertices of Tn(k) there is a vertex y which dominates all k elements of S. (Such a tournament will be said to have property Pk .)
Graham, R. L.; Spencer, J. H. A Constructive Solution to a Tournament Problem. Canadian mathematical bulletin, Tome 14 (1971) no. 1, pp. 45-48. doi: 10.4153/CMB-1971-007-1
@article{10_4153_CMB_1971_007_1,
author = {Graham, R. L. and Spencer, J. H.},
title = {A {Constructive} {Solution} to a {Tournament} {Problem}},
journal = {Canadian mathematical bulletin},
pages = {45--48},
year = {1971},
volume = {14},
number = {1},
doi = {10.4153/CMB-1971-007-1},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1971-007-1/}
}
TY - JOUR AU - Graham, R. L. AU - Spencer, J. H. TI - A Constructive Solution to a Tournament Problem JO - Canadian mathematical bulletin PY - 1971 SP - 45 EP - 48 VL - 14 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1971-007-1/ DO - 10.4153/CMB-1971-007-1 ID - 10_4153_CMB_1971_007_1 ER -
Cité par Sources :