Abstract
Some combinatorial problems occurring in scheduling the games of a sports league are presented; solutions are obtained by constructing oriented factorisations of complete graphs. One considers schedules with a minimum number of breaks in the sequences of home-games and away-games and schedules with minimum number of days with breaks. Some open problems are also mentioned.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call