Hostname: page-component-89b8bd64d-b5k59 Total loading time: 0 Render date: 2026-05-08T11:46:36.756Z Has data issue: false hasContentIssue false

A Constructive Solution to a Tournament Problem

Published online by Cambridge University Press:  20 November 2018

R. L. Graham
Affiliation:
Bell Telephone Laboratories Inc., Murray Hill, New Jersey
J. H. Spencer
Affiliation:
The Rand Corporation, Santa Monica, California
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1971