Vol. 21, No. 3, 1967

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Vol. 286: 1  2
Vol. 285: 1  2
Vol. 284: 1  2
Vol. 283: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Subscriptions
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
Generating oriented graphs by means of team comparisons

John W. Moon and Leo Moser

Vol. 21 (1967), No. 3, 531–535
Abstract

Two teams A and B can be compared by matching each player in A against each player in B. We say that A > B if and only if the players of A collectively win more games against players of B than they lose. If there are n teams T1,T2,,Tn, then the outcomes of the matches between the various teams may be represented by an oriented graph Hn on n nodes in which an arc goes from the i-th node to the j-th node if and only if Tj > Tj. It is shown that any oriented graph can be generated in this way, and that the minimum number of players necessary to generate any oriented graph Hn is of the order of nzlog n.

Mathematical Subject Classification
Primary: 05.65
Milestones
Received: 25 July 1966
Published: 1 June 1967
Authors
John W. Moon
Leo Moser