Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-18T04:25:44.508Z Has data issue: false hasContentIssue false
  • English
  • Français

A tournament problem

Published online by Cambridge University Press:  17 February 2009

W. D. Wallis
W. D. Wallis
Affiliation:
Department of Mathematics, University of Newcastle, Newcastle, N.S.W. 2308
Rights & Permissions [Opens in a new window]

Abstract

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.

It is shown that, for any round-robin tournament, one can find a pairing of the teams and allocate home and away matches so that only one member of each pair plays at home in each round.

Type
Research Article
Information
The ANZIAM Journal , Volume 24 , Issue 3 , January 1983 , pp. 289 - 291
Copyright
Copyright © Australian Mathematical Society 1983

References

[1]Beecham, A. F. and Hurley, A. C., “A scheduling problem with a simple graphical solution”, J. Austral. Math. Soc. Ser. B 21 (1980), 486–495.CrossRefGoogle Scholar
[2]Harary, F., Graph Theory (Addison-Wesley, Reading, Mass., 1969).CrossRefGoogle Scholar