Date of Submission
Academic Programs and Concentrations
Project Advisor 1
In this project we will be looking at tournaments on graphs and their win sequences. The main purpose for a tournament is to determine a winner amongst a group of competitors. Usually tournaments are played in an elimination style where the winner of a game advances and the loser is knocked out the tournament. For the purpose of this project I will be focusing on Round Robin Tournaments where all competitors get the opportunity to play against each other once. This style of tournaments gives us a more real life perspective of a fair tournament. We will model these Round Robin Tournaments on tournament graphs which are connected graphs with directed edges. With a value placed on a win and loss, I will explore these conditions and look at what can be said about the win sequences of these tournament graphs. With these conditions, patterns were detected with small sized tournaments and were proved for all tournaments. Other patterns still remain as conjectures.
Open Access Agreement
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Lewis, Sadiki O., "Exploring Tournament Graphs and Their Win Sequences" (2016). Senior Projects Fall 2016. 43.