Pitch tournaments: A new class of combinatorial designs
This work investigates a new type of tournament design called a pitch tournament design. The problem is introduced and defined, specific examples and infinite classes of pitch tournaments are provided, and several theorems that provide constructions are stated and proved. Several specializations are also introduced, i.e. pitch tournaments that possess additional features. The existence of pitch tournaments on v players where v = 8n + 1 is investigated and it is established that pitch tournaments exist for all v = 8n + 1 with at most 36 possible exceptions. ^
Scott J Lewis,
"Pitch tournaments: A new class of combinatorial designs"
Dissertations and Master's Theses (Campus Access).