{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-3045"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-3045","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"On graph decompositions: Exploring the stars and stripes problem with odd n-stars","abstract":"This dissertation addresses the “Stars and Stripes\" problem, which is a graph decomposition problem. The Stars and Stripes problem can be described as finding uniformly resolvable decompositions when the blocks are either $n$-stars or edges. In other words, this refers to decomposing a complete graph into spanning sub-graphs, these spanning sub-graphs are either a union of disjoint $n$-stars or a union of disjoint edges. We will call these $n$-star factors and $1$-factors respectively. A given complete graph which satisfies the necessary condition (\\ref{ness}) can potentially be decomposed into $r$ $1$-factors and $s$ $n$-star factors. The goal of this problem is to find a solution for every pair $(r,s)$ and every complete graph that satisfies the necessary conditions. This dissertation focuses on the odd $n$-star cases of the problem. We present the solutions we have found along with the remaining open cases. In Chapter \\ref{ch2 WC}, we present a method for decomposing a complete graph into cycles using weighted graphs. This method provides solutions for most cases where $v$ is large. However, this method requires our decomposition to contain a certain number of $1$-factors. Thus, we cannot find solutions for extreme cases, that is $(r,s)$ pairs when $r$ is very small. Because the technique in the Chapter \\ref{ch2 WC} does not apply to extreme cases, we began to study the most extreme cases, where $r=1$. In Chapter \\ref{ch3 5star}, we give solutions for the case when $r=1$ and $n=5$. The generalized version, when $r=1$ and $n$ is odd, is presented in Chapter \\ref{ch4 Nstar}. The results in Chapters \\ref{ch3 5star} and \\ref{ch4 Nstar} are obtained fundamentally by the same method. However, the constructions in Chapter \\ref{ch4 Nstar} are much more complex, and there are many more detailed cases.","abstract_html":"This dissertation addresses the “Stars and Stripes&quot; problem, which is a graph decomposition problem. The Stars and Stripes problem can be described as finding uniformly resolvable decompositions when the blocks are either $n$-stars or edges. In other words, this refers to decomposing a complete graph into spanning sub-graphs, these spanning sub-graphs are either a union of disjoint $n$-stars or a union of disjoint edges. We will call these $n$-star factors and $1$-factors respectively. A given complete graph which satisfies the necessary condition (\\ref{ness}) can potentially be decomposed into $r$ $1$-factors and $s$ $n$-star factors. The goal of this problem is to find a solution for every pair $(r,s)$ and every complete graph that satisfies the necessary conditions. This dissertation focuses on the odd $n$-star cases of the problem. We present the solutions we have found along with the remaining open cases. In Chapter \\ref{ch2 WC}, we present a method for decomposing a complete graph into cycles using weighted graphs. This method provides solutions for most cases where $v$ is large. However, this method requires our decomposition to contain a certain number of $1$-factors. Thus, we cannot find solutions for extreme cases, that is $(r,s)$ pairs when $r$ is very small. Because the technique in the Chapter \\ref{ch2 WC} does not apply to extreme cases, we began to study the most extreme cases, where $r=1$. In Chapter \\ref{ch3 5star}, we give solutions for the case when $r=1$ and $n=5$. The generalized version, when $r=1$ and $n$ is odd, is presented in Chapter \\ref{ch4 Nstar}. The results in Chapters \\ref{ch3 5star} and \\ref{ch4 Nstar} are obtained fundamentally by the same method. However, the constructions in Chapter \\ref{ch4 Nstar} are much more complex, and there are many more detailed cases.","abstract_has_math":true,"creators":["Lee, Jehyun"],"institution":null,"degree_name":"Doctor of Philosophy in Mathematical Sciences (PhD)","degree_level":"Campus Access Dissertation","degree_discipline":"Department of Mathematical Sciences","degree_department":null,"school":null,"contributors":["Melissa S. Keranen"],"advisors":[],"committee_chairs":[],"committee_members":["William J. Keith","Robert P. Schneider","Soner Onder"],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:19:20Z","subjects":["Graph Decompositions","Discrete Mathematics and Combinatorics","Other Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.mtu.edu/etdr/1940"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/1940","href":"https://digitalcommons.mtu.edu/etdr/1940","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/1940","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/1940","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-3045","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Melissa S. Keranen"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["William J. Keith","Robert P. Schneider","Soner Onder"]},{"key":"dc:creator","label":"Author","values":["Lee, Jehyun"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2025-04-17T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2025-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Campus 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 Decompositions","Discrete Mathematics and Combinatorics","Other Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.37099/mtu.dc.etdr/1940","https://digitalcommons.mtu.edu/etdr/1940"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This dissertation addresses the “Stars and Stripes\" problem, which is a graph decomposition problem. The Stars and Stripes problem can be described as finding uniformly resolvable decompositions when the blocks are either $n$-stars or edges. In other words, this refers to decomposing a complete graph into spanning sub-graphs, these spanning sub-graphs are either a union of disjoint $n$-stars or a union of disjoint edges. We will call these $n$-star factors and $1$-factors respectively. A given complete graph which satisfies the necessary condition (\\ref{ness}) can potentially be decomposed into $r$ $1$-factors and $s$ $n$-star factors. The goal of this problem is to find a solution for every pair $(r,s)$ and every complete graph that satisfies the necessary conditions. This dissertation focuses on the odd $n$-star cases of the problem. We present the solutions we have found along with the remaining open cases. In Chapter \\ref{ch2 WC}, we present a method for decomposing a complete graph into cycles using weighted graphs. This method provides solutions for most cases where $v$ is large. However, this method requires our decomposition to contain a certain number of $1$-factors. Thus, we cannot find solutions for extreme cases, that is $(r,s)$ pairs when $r$ is very small. Because the technique in the Chapter \\ref{ch2 WC} does not apply to extreme cases, we began to study the most extreme cases, where $r=1$. In Chapter \\ref{ch3 5star}, we give solutions for the case when $r=1$ and $n=5$. The generalized version, when $r=1$ and $n$ is odd, is presented in Chapter \\ref{ch4 Nstar}. The results in Chapters \\ref{ch3 5star} and \\ref{ch4 Nstar} are obtained fundamentally by the same method. However, the constructions in Chapter \\ref{ch4 Nstar} are much more complex, and there are many more detailed cases."]},{"key":"dc:title","label":"Title","values":["On graph decompositions: Exploring the stars and stripes problem with odd n-stars"]}]}],"canonical_facts":{"dc:contributor":["Melissa S. Keranen"],"dc:contributor.committeemember":["William J. Keith","Robert P. Schneider","Soner Onder"],"dc:creator":["Lee, Jehyun"],"dc:date.available":["2025-04-17T07:00:00Z"],"dc:date.created":["2025-01-01T08:00:00Z"],"dc:description.abstract":["This dissertation addresses the “Stars and Stripes\" problem, which is a graph decomposition problem. The Stars and Stripes problem can be described as finding uniformly resolvable decompositions when the blocks are either $n$-stars or edges. In other words, this refers to decomposing a complete graph into spanning sub-graphs, these spanning sub-graphs are either a union of disjoint $n$-stars or a union of disjoint edges. We will call these $n$-star factors and $1$-factors respectively. A given complete graph which satisfies the necessary condition (\\ref{ness}) can potentially be decomposed into $r$ $1$-factors and $s$ $n$-star factors. The goal of this problem is to find a solution for every pair $(r,s)$ and every complete graph that satisfies the necessary conditions. This dissertation focuses on the odd $n$-star cases of the problem. We present the solutions we have found along with the remaining open cases. In Chapter \\ref{ch2 WC}, we present a method for decomposing a complete graph into cycles using weighted graphs. This method provides solutions for most cases where $v$ is large. However, this method requires our decomposition to contain a certain number of $1$-factors. Thus, we cannot find solutions for extreme cases, that is $(r,s)$ pairs when $r$ is very small. Because the technique in the Chapter \\ref{ch2 WC} does not apply to extreme cases, we began to study the most extreme cases, where $r=1$. In Chapter \\ref{ch3 5star}, we give solutions for the case when $r=1$ and $n=5$. The generalized version, when $r=1$ and $n$ is odd, is presented in Chapter \\ref{ch4 Nstar}. The results in Chapters \\ref{ch3 5star} and \\ref{ch4 Nstar} are obtained fundamentally by the same method. However, the constructions in Chapter \\ref{ch4 Nstar} are much more complex, and there are many more detailed cases."],"dc:identifier":["10.37099/mtu.dc.etdr/1940","https://digitalcommons.mtu.edu/etdr/1940"],"dc:subject":["Graph Decompositions","Discrete Mathematics and Combinatorics","Other Mathematics"],"dc:title":["On graph decompositions: Exploring the stars and stripes problem with odd n-stars"],"thesis:degree_discipline":["Department of Mathematical Sciences"],"thesis:degree_level":["Campus Access Dissertation"],"thesis:degree_name":["Doctor of Philosophy in Mathematical Sciences (PhD)"]},"updated_at":"2026-11-19T08:19:20Z"}