Back to search

Michigan Technological University

ON GRAPH DECOMPOSITIONS AND DESIGNS: EXPLORING THE HAMILTON-WATERLOO PROBLEM WITH A FACTOR OF 6-CYCLES AND PROJECTIVE PLANES OF ORDER 16

Abstract

dc:description.abstract

This dissertation tackles the challenging graph decomposition problem of finding solutions to the uniform case of the Hamilton-Waterloo Problem (HWP). The HWP seeks decompositions of complete graphs into cycles of specific lengths. Here, we focus on cases with a single factor of 6-cycles. The dissertation then delves into the construction of 1-rotational designs, a concept from finite geometry. It explores the connection between these designs and finite projective planes, which are specific geometric structures. Finally, the dissertation proposes a potential link between these seemingly separate areas. It suggests investigating whether 1-rotational designs might hold the key to solving unsolved instances of the uniform HWP. By exploring this connection, the research aims to find new constructions and solutions for these long standing open problems.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy in Mathematical Sciences (PhD)
Level thesis:degree_level
Open Access Dissertation
Discipline thesis:degree_discipline
Department of Mathematical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Santizo Huerta, Zazil
Committee members dc:contributor.committeemember
  • William Keith
  • Fabrizio Zanello
  • Soner Onder
Contributors dc:contributor
  • Melissa Keranen

Subjects

dc:subject × 6

Identifiers

dc:identifier.*

Chain of custody

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

Santizo Huerta, Zazil. ON GRAPH DECOMPOSITIONS AND DESIGNS: EXPLORING THE HAMILTON-WATERLOO PROBLEM WITH A FACTOR OF 6-CYCLES AND PROJECTIVE PLANES OF ORDER 16. Open Access Dissertation thesis, https://doi.org/10.37099/mtu.dc.etdr/1740