Back to search

University of Victoria (Canada)

On 1-factorizations of the complete graph and the relationship to round robin schedules

Abstract

dc:description.abstract

The following new results concerning 1-factorizations of the complete graph are proved: (1) There are exactly 6 equivalence classes of 1-factorizations of the complete graph with 8 vertices. (2). There are exactly 396 equivalence classes of 1-factorizations of the complete graph with 10 vertices. Representatives of each of the equivalence classes are presented. The size of the automorphism group of each equivalence class of 1-factorizations of the complete graph with 2n vertices for n ≤ 5 is also found. Several theorems and results related to 1-factorizations of the complete graph are presented, and the relationship to round robin schedules is shown. An application problem demonstrates the importance of the choice of the equivalence class of round robin schedules in the solvability of the problem.

Degree

thesis:*
Level thesis:degree_level
Master of Arts M.A.
Department thesis:degree_department
Department of Mathematics and Statistics
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Gelling, Eric Neil
Advisor dc:contributor.supervisor
  • Odeh, Robert E.

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • Available to the World Wide Web
Language dc:language.iso
en, English

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1828/7341

Chain of custody

source
Harvested from
University of Victoria (Canada)
Base URL
dspace.library.uvic.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Gelling, Eric Neil. On 1-factorizations of the complete graph and the relationship to round robin schedules. Master of Arts M.A. thesis, 2016. http://hdl.handle.net/1828/7341