No CrossRef data available.
Article contents
Constructing tournament designs
Published online by Cambridge University Press: 01 August 2016
Extract
Suppose that an even number 2n of teams take part in a football league, and that each team is to play each other team once. Suppose also that the games are to be scheduled for 2n 1 days, each team playing one game on each day. How can a league schedule be produced? There are many ways of doing this, but one particularly simple method will be described.
- Type
- Research Article
- Information
- Copyright
- Copyright © The Mathematical Association 1989
References
Further reading
Baker, R.D., Whist tournaments, Proc. 6th South-east conf. in combinatorics, graph theory and computing, Congressus numerantium, 14, 89–100 (1975).Google Scholar
Mullin, R.C. and Wallis, W.D., The existence of Room squares, Aequationes Math., 13, 1–7 (1975).Google Scholar
Wallis, W.D., A tournament problem, J. Austral. Math. Soc. (B), 24, 289–291 (1983).CrossRefGoogle Scholar
de Werra, D., Scheduling in sports, Studies on graphs and discrete programming, North Holland, 381–395 (1981).Google Scholar