Author:
Graham R. L.,Spencer J. H.
Abstract
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.)
Publisher
Canadian Mathematical Society
Cited by
87 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献