Conference Athletic Schedules: An Application of Projective Geometry, Finite Fields, and Graph Theory
2016-05
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Conference Athletic Schedules: An Application of Projective Geometry, Finite Fields, and Graph Theory
Authors
Published Date
2016-05
Publisher
Type
Thesis or Dissertation
Abstract
This paper solves a problem faced by the Suburban East Conference of the Minnesota State High School League in 2009, of designing a consistent wrestling schedule to accommodate a new school. We adapt the application of projective geometry of finite fields to general scheduling problems, and develop an algorithm for determining a schedule. We prove that this algorithm can be completed, will yield the desired schedule, and can yield all possible schedules in the desired format. We also model the schedule with bipartite graphs, and use edge colorings to complete the schedule with home and away assignments.
Keywords
Description
University of Minnesota M.S. thesis. May 2016. Major: Mathematics. Advisor: Bert Fristedt. 1 computer file (PDF); iii, 24 pages.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Nelson, Alexandra. (2016). Conference Athletic Schedules: An Application of Projective Geometry, Finite Fields, and Graph Theory. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/181810.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.