Counting the number of round-robin tournament schedules (Q301476)

This article studies the round-robin algorithm for organizing tournament schedules, in particular a method of using chromatic polynomials in graph theory to find, under certain conditions, the total number of possible tournament schedules. The paper begins with a background to the problem of constructing tournament schedules, the round-robin algorithm and an introduction to the Maple software which was used for the analysis. This is followed by a series of theorems, with proofs, relating to counting all the possible tournament schedules and several examples and counterexamples which illustrate the main points studied in this interesting article.