{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-1245"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-1245","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"Two Problems of Gerhard Ringel","abstract":"Gerhard Ringel was an Austrian Mathematician, and is regarded as one of the most influential graph theorists of the twentieth century. This work deals with two problems that arose from Ringel's research: the Hamilton-Waterloo Problem, and the problem of R-Sequences. The Hamilton-Waterloo Problem (HWP) in the case of Cm-factors and Cn-factors asks whether Kv, where v is odd (or Kv-F, where F is a 1-factor and v is even), can be decomposed into r copies of a 2-factor made entirely of m-cycles and s copies of a 2-factor made entirely of n-cycles. Chapter 1 gives some general constructions for such decompositions and apply them to the case where m=3 and n=3x. This problem is settle for odd v, except for a finite number of x values. When v is even, significant progress is made on the problem, although open cases are left. In particular, the difficult case of v even and s=1 is left open for many situations. Chapter 2 generalizes the Hamilton-Waterloo Problem to complete equipartite graphs K(n:m) and shows that K(xyzw:m) can be decomposed into s copies of a 2-factor consisting of cycles of length xzm and r copies of a 2-factor consisting of cycles of length yzm, whenever m is odd, s,r≠1, gcd(x,z)=gcd(y,z)=1 and xyz≠0 (mod 4). Some more general constructions are given for the case when the cycles in a given two factor may have different lengths. These constructions are used to find solutions to the Hamilton-Waterloo problem for complete graphs. Chapter 3 completes the proof of the Friedlander, Gordon and Miller Conjecture that every finite abelian group whose Sylow 2-subgroup either is trivial or both non-trivial and non-cyclic is R-sequenceable. This settles a question of Ringel for abelian groups.","abstract_html":"Gerhard Ringel was an Austrian Mathematician, and is regarded as one of the most influential graph theorists of the twentieth century. This work deals with two problems that arose from Ringel&#x27;s research: the Hamilton-Waterloo Problem, and the problem of R-Sequences. The Hamilton-Waterloo Problem (HWP) in the case of Cm-factors and Cn-factors asks whether Kv, where v is odd (or Kv-F, where F is a 1-factor and v is even), can be decomposed into r copies of a 2-factor made entirely of m-cycles and s copies of a 2-factor made entirely of n-cycles. Chapter 1 gives some general constructions for such decompositions and apply them to the case where m=3 and n=3x. This problem is settle for odd v, except for a finite number of x values. When v is even, significant progress is made on the problem, although open cases are left. In particular, the difficult case of v even and s=1 is left open for many situations. Chapter 2 generalizes the Hamilton-Waterloo Problem to complete equipartite graphs K(n:m) and shows that K(xyzw:m) can be decomposed into s copies of a 2-factor consisting of cycles of length xzm and r copies of a 2-factor consisting of cycles of length yzm, whenever m is odd, s,r≠1, gcd(x,z)=gcd(y,z)=1 and xyz≠0 (mod 4). Some more general constructions are given for the case when the cycles in a given two factor may have different lengths. These constructions are used to find solutions to the Hamilton-Waterloo problem for complete graphs. Chapter 3 completes the proof of the Friedlander, Gordon and Miller Conjecture that every finite abelian group whose Sylow 2-subgroup either is trivial or both non-trivial and non-cyclic is R-sequenceable. This settles a question of Ringel for abelian groups.","abstract_has_math":false,"creators":["Pastine, Adrian"],"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":["Donald L. Kreher","Melissa S. Keranen"],"advisors":[],"committee_chairs":[],"committee_members":["Stefaan De Winter","Dalibor Froncek"],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:16:45Z","subjects":["Graph decomposition","cycles in graphs","Hamilton-Waterloo Problem","R-Sequences","Complete Equipartite Graphs","Cayley Graphs","Discrete Mathematics and Combinatorics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.mtu.edu/etdr/199"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/199","href":"https://digitalcommons.mtu.edu/etdr/199","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/199","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/199","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-1245","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Donald L. Kreher","Melissa S. Keranen"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Stefaan De Winter","Dalibor Froncek"]},{"key":"dc:creator","label":"Author","values":["Pastine, Adrian"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2017-07-27T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2016-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":["Graph decomposition","cycles in graphs","Hamilton-Waterloo Problem","R-Sequences","Complete Equipartite Graphs","Cayley Graphs","Discrete Mathematics and Combinatorics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.37099/mtu.dc.etdr/199","https://digitalcommons.mtu.edu/etdr/199"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Gerhard Ringel was an Austrian Mathematician, and is regarded as one of the most influential graph theorists of the twentieth century. This work deals with two problems that arose from Ringel's research: the Hamilton-Waterloo Problem, and the problem of R-Sequences. The Hamilton-Waterloo Problem (HWP) in the case of Cm-factors and Cn-factors asks whether Kv, where v is odd (or Kv-F, where F is a 1-factor and v is even), can be decomposed into r copies of a 2-factor made entirely of m-cycles and s copies of a 2-factor made entirely of n-cycles. Chapter 1 gives some general constructions for such decompositions and apply them to the case where m=3 and n=3x. This problem is settle for odd v, except for a finite number of x values. When v is even, significant progress is made on the problem, although open cases are left. In particular, the difficult case of v even and s=1 is left open for many situations. Chapter 2 generalizes the Hamilton-Waterloo Problem to complete equipartite graphs K(n:m) and shows that K(xyzw:m) can be decomposed into s copies of a 2-factor consisting of cycles of length xzm and r copies of a 2-factor consisting of cycles of length yzm, whenever m is odd, s,r≠1, gcd(x,z)=gcd(y,z)=1 and xyz≠0 (mod 4). Some more general constructions are given for the case when the cycles in a given two factor may have different lengths. These constructions are used to find solutions to the Hamilton-Waterloo problem for complete graphs. Chapter 3 completes the proof of the Friedlander, Gordon and Miller Conjecture that every finite abelian group whose Sylow 2-subgroup either is trivial or both non-trivial and non-cyclic is R-sequenceable. This settles a question of Ringel for abelian groups."]},{"key":"dc:description.note","label":"Dc Description Note","values":["<p>The copyright agreement for Chapter 1 is included as an additional file.</p>"]},{"key":"dc:title","label":"Title","values":["Two Problems of Gerhard Ringel"]}]}],"canonical_facts":{"dc:contributor":["Donald L. Kreher","Melissa S. Keranen"],"dc:contributor.committeemember":["Stefaan De Winter","Dalibor Froncek"],"dc:creator":["Pastine, Adrian"],"dc:date.available":["2017-07-27T07:00:00Z"],"dc:date.created":["2016-01-01T08:00:00Z"],"dc:description.abstract":["Gerhard Ringel was an Austrian Mathematician, and is regarded as one of the most influential graph theorists of the twentieth century. This work deals with two problems that arose from Ringel's research: the Hamilton-Waterloo Problem, and the problem of R-Sequences. The Hamilton-Waterloo Problem (HWP) in the case of Cm-factors and Cn-factors asks whether Kv, where v is odd (or Kv-F, where F is a 1-factor and v is even), can be decomposed into r copies of a 2-factor made entirely of m-cycles and s copies of a 2-factor made entirely of n-cycles. Chapter 1 gives some general constructions for such decompositions and apply them to the case where m=3 and n=3x. This problem is settle for odd v, except for a finite number of x values. When v is even, significant progress is made on the problem, although open cases are left. In particular, the difficult case of v even and s=1 is left open for many situations. Chapter 2 generalizes the Hamilton-Waterloo Problem to complete equipartite graphs K(n:m) and shows that K(xyzw:m) can be decomposed into s copies of a 2-factor consisting of cycles of length xzm and r copies of a 2-factor consisting of cycles of length yzm, whenever m is odd, s,r≠1, gcd(x,z)=gcd(y,z)=1 and xyz≠0 (mod 4). Some more general constructions are given for the case when the cycles in a given two factor may have different lengths. These constructions are used to find solutions to the Hamilton-Waterloo problem for complete graphs. Chapter 3 completes the proof of the Friedlander, Gordon and Miller Conjecture that every finite abelian group whose Sylow 2-subgroup either is trivial or both non-trivial and non-cyclic is R-sequenceable. This settles a question of Ringel for abelian groups."],"dc:description.note":["<p>The copyright agreement for Chapter 1 is included as an additional file.</p>"],"dc:identifier":["10.37099/mtu.dc.etdr/199","https://digitalcommons.mtu.edu/etdr/199"],"dc:subject":["Graph decomposition","cycles in graphs","Hamilton-Waterloo Problem","R-Sequences","Complete Equipartite Graphs","Cayley Graphs","Discrete Mathematics and Combinatorics"],"dc:title":["Two Problems of Gerhard Ringel"],"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:16:45Z"}