Hostname: page-component-7dd5485656-wxk4p Total loading time: 0 Render date: 2025-10-30T15:05:24.212Z Has data issue: false hasContentIssue false
  • English
  • Français

On a Problem of Schütte and Erdös

Published online by Cambridge University Press:  03 November 2016

Esther Szekeres  and
G. Szekeres
Esther Szekeres
Affiliation:
University of Sydney
G. Szekeres
Affiliation:
University of New South Wales, Sydney, Australia
Get access Rights & Permissions [Opens in a new window]

Extract

Let Gn be a complete directed graph of order n. That is, Gn has n nodes and every pair of nodes is connected by exactly one directed edge. We say, Gn has the property Sk (after Schütte who posed the problem) if for every set of k nodes there is at least one node in Gn from which the edges go out to the given k nodes.

Information

Type
Research Article
Information
The Mathematical Gazette , Volume 49 , Issue 369 , October 1965 , pp. 290 - 293
Copyright
Copyright © Mathematical Association 1965 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable