{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-2859"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-2859","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"ON GRAPH DECOMPOSITIONS AND DESIGNS: EXPLORING THE HAMILTON-WATERLOO PROBLEM WITH A FACTOR OF 6-CYCLES AND PROJECTIVE PLANES OF ORDER 16","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Santizo Huerta, Zazil"],"institution":null,"degree_name":"Doctor of Philosophy in Mathematical Sciences (PhD)","degree_level":"Open Access Dissertation","degree_discipline":"Department of Mathematical Sciences","degree_department":null,"school":null,"contributors":["Melissa Keranen"],"advisors":[],"committee_chairs":[],"committee_members":["William Keith","Fabrizio Zanello","Soner Onder"],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:19:03Z","subjects":["The Hamilton-Waterloo Problem","Graph Decomposition","1-Rotational Designs","Maximal Arcs","Projective Planes.","Discrete Mathematics and Combinatorics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.mtu.edu/etdr/1740"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/1740","href":"https://digitalcommons.mtu.edu/etdr/1740","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/1740","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/1740","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.mtu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.mtu.edu%3Aetdr-2859","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Melissa Keranen"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["William Keith","Fabrizio Zanello","Soner Onder"]},{"key":"dc:creator","label":"Author","values":["Santizo Huerta, Zazil"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2024-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Open Access Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy in Mathematical Sciences (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["The Hamilton-Waterloo Problem","Graph Decomposition","1-Rotational Designs","Maximal Arcs","Projective Planes.","Discrete Mathematics and Combinatorics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.37099/mtu.dc.etdr/1740","https://digitalcommons.mtu.edu/etdr/1740"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["ON GRAPH DECOMPOSITIONS AND DESIGNS: EXPLORING THE HAMILTON-WATERLOO PROBLEM WITH A FACTOR OF 6-CYCLES AND PROJECTIVE PLANES OF ORDER 16"]}]}],"canonical_facts":{"dc:contributor":["Melissa Keranen"],"dc:contributor.committeemember":["William Keith","Fabrizio Zanello","Soner Onder"],"dc:creator":["Santizo Huerta, Zazil"],"dc:date.created":["2024-01-01T08:00:00Z"],"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."],"dc:identifier":["10.37099/mtu.dc.etdr/1740","https://digitalcommons.mtu.edu/etdr/1740"],"dc:subject":["The Hamilton-Waterloo Problem","Graph Decomposition","1-Rotational Designs","Maximal Arcs","Projective Planes.","Discrete Mathematics and Combinatorics"],"dc:title":["ON GRAPH DECOMPOSITIONS AND DESIGNS: EXPLORING THE HAMILTON-WATERLOO PROBLEM WITH A FACTOR OF 6-CYCLES AND PROJECTIVE PLANES OF ORDER 16"],"thesis:degree_discipline":["Department of Mathematical Sciences"],"thesis:degree_level":["Open Access Dissertation"],"thesis:degree_name":["Doctor of Philosophy in Mathematical Sciences (PhD)"]},"updated_at":"2026-11-19T08:19:03Z"}