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

Files

Gelling_N_MA_1973.pdf (143.42 MB)

Date

2016-06-10

Authors

Gelling, Eric Neil

Journal Title

Journal ISSN

Volume Title

Publisher

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.

Description

Keywords

graph theory

Citation

URI

http://hdl.handle.net/1828/7341

Collections

ETD (Electronic Theses and Dissertations)
Theses (Mathematics and Statistics)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.