Cover: Notes on Combinatorial Mathematics : Transitive Subtournaments.

Notes on Combinatorial Mathematics : Transitive Subtournaments.

Published 1969

by J. H. Spencer

Purchase Print Copy

 Format Price
Add to Cart Paperback $20.00

Description of a round robin tournament in which each player plays one game with every other player, and each game ends in a win for one of the players. In a tournament of this type with 15 players, it is shown that some 5 players will be involved in a transitive subtournament. That is, considering only the games that the 5 players play among themselves, the players can be ranked in such a way that no upsets occur. Although the same result has been obtained by other authors using different techniques, this proof is unique in that it involves close scrutiny of the subtournament of players that have lost to one individual player. Certain families of sets of players are studied that turn out to be Steiner triple systems on seven elements. This result disproves a conjecture of the Hungarian mathematicians P. Erdos and L. Moser. 18 pp. Refs. (Author)

This report is part of the RAND research memorandum series. The Research Memorandum was a product of RAND from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.