Marshall University Math Colloquium
September 9, 2015
Michael Schroeder
Marshall University
Abstract
In this talk, we will discuss round-robin tournaments — tournaments in which each team plays every other team. We’ll look at how to schedule games in a way so that, if there is only one playing surface, that no team is unreasonably burdened by playing games back-to-back. We’ll also talk about what the possible win-loss records are for teams which play in a round-robin tournament. We’ll relate this to complete graphs, score sequences, Landau’s inequalities, and matching sequencibility. A majority of this talk will be accessible to a general audience.