Back to search

Hosted by Utah State University Libraries

Tournament Matrices an Overview

Abstract

dc:description.abstract

The results of a round robin tournament can be represented as a matrix of zeros and ones, by ordering the players and placing a one in the (i,j) position if player i beat player j, and zeros otherwise. These matrices, called tournament matrices, can be represented by graphs, called tournament graphs. They have been the subject of much research and study, yet there have been few attempts to give a wide exposition on the subject. Those that have been done tend to focus on the graph theoretical aspects of tournaments. S. Ree and Y. Koh did write a brief survey from the matrix viewpoint in 1998, but it was not complete and not published. This paper is an attempt to give an exposition on tournament matrices. Recent research will be presented, some new ideas and properties will be proposed, and a few applications of the material will be reviewed.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (PhD)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematics and Statistics
Grantor dc:publisher
Hosted by Utah State University Libraries

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Carlson, Russel O.
Contributors dc:contributor
  • LeRoy B. Beasley

Subjects

dc:subject × 5

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Utah State University
Base URL
digitalcommons.usu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Carlson, Russel O.. Tournament Matrices an Overview. Dissertation thesis, Hosted by Utah State University Libraries, https://digitalcommons.usu.edu/etd/7070