In our earlier paper, we studied the mathematical structure of equitable round-robin tournaments with home-away assignments, and gave some necessary conditions for their feasibility in terms of friend-enemy tables and break interval sequences. We also enumerated all the feasible home-away tables of such tournaments satisfying both the opening and the closing conditions, up to 26 teams.

Inthispaper,westudythemaximalbreakintervalofsuch tournaments. From this point of view, the tournaments satisfying both the opening and the closing conditions correspond to the case where the maximal break interval is greater than or equal to 4. The aim of this paper is to examine the case where the maximal break interval is greater than or equal to 5. We enumerate all the feasible cyclic break interval sequences of such tournaments, up to 42 teams.

sports scheduling, equitable round-robin tournament, home-away table, friend-enemy table, break interval sequence, maximal break interval.