Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-10T13:48:29.455Z Has data issue: false hasContentIssue false
  • English
  • Français

ON THE ORGANIZATION OF ROUND ROBIN TOURNAMENTS WITH CONSTRAINTS

Part of: Graph theory

Published online by Cambridge University Press:  01 July 2014

M. H. EGGAR
M. H. EGGAR*
Affiliation:
School of Mathematics, University of Edinburgh, JCMB, KB, Edinburgh EH9 3JZ, UK email m.eggar@yahoo.co.uk
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.

A sporting league places every team into one of several divisions of equal size, and runs a round robin tournament for each division. Some teams are paired with another team, not necessarily in the same division, to share facilities. It is shown that however many teams are paired and whatever the pairings, it is always possible to schedule the fixtures in the minimum time, so that no two paired teams have home matches simultaneously.

Keywords

round robin tournamentspairings

MSC classification

Secondary: 05C20: Directed graphs (digraphs), tournaments
Type
Research Article
Information
The ANZIAM Journal , Volume 55 , Issue 4 , April 2014 , pp. 357 - 361
Copyright
Copyright © 2014 Australian Mathematical Society 

References

Diestel, R., Graph theory, 4th edn. Volume 173 of Graduate Texts in Mathematics Series (Springer, Heidelberg, 2010).Google Scholar
Dinitz, J. H., Froncek, D., Lamken, E. R. and Wallis, W. D., “Scheduling a tournament”, in: Handbook of combinatorial designs (eds Colbourn, C. J. and Dinitz, J. H.), (CRC Press, Boca Raton, FL, 2006) , 590–606.Google Scholar
Rasmussen, R. V. and Trick, M. A., “Round robin scheduling—a survey”, European J. Oper. Res. 188(3) (2008) 617–636; doi:10.1016/j.ejor.2007.05.046.Google Scholar