This book investigates the mathematical principles and construction methods underlying the design of various tournament formats. Author Ian Anderson, a recognized expert in combinatorial mathematics, utilizes a rigorous framework to explain how discrete structures can be applied to scheduling problems. By synthesizing historical development with modern construction techniques, the text provides a comprehensive guide for both students and practitioners interested in the intersection of graph theory and competitive scheduling.

Experts identify this work as a foundational text for those studying the application of combinatorial designs to real-world scheduling problems. Readers frequently note the clarity of the examples and the historical context provided, making it an accessible resource for advanced undergraduate and graduate students.