{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:15642"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:15642","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"On resolvable decomposition problems","abstract":"Given graphs \\(F\\) and \\(G\\), a resolvable \\(F\\)-decomposition of \\(G\\) is a partition of its edges into \\(F\\)-factors. We study the existence of resolvable cycle and clique decompositions in graphs with high minimum degree and pseudo-random graphs. We show a Dirac-type result for the uniform case of the Oberwolfach problem and make progress towards a conjecture by Glock, Joos, Kim, Kühn and Osthus. Specifically, we prove that for any \\(\\alpha>0\\) there is an integer \\(r_0\\) such that for any \\(r\\geq r_0\\), any sufficiently large graph \\(G\\) on \\(n\\) vertices, with \\(r\\mid n\\), even degree, and minimum degree \\((1/2+\\alpha)n\\), has a resolvable \\(C_r\\)-decomposition. The term \\(1/2\\) in the minimum degree bound is best possible. We show that any sufficiently large pseudo-random graph that satisfies the necessary divisibility conditions has a resolvable \\(K_r\\)-decomposition. We also prove the analogue for multipartite graphs. That is, any sufficiently large \\(r\\)-partite pseudo-random graph that satisfies the necessary divisibility conditions has a resolvable \\(K_r\\)-decomposition. Our methods are purely combinatorial and combine iterative absorption with a new technique on finding a fractional decomposition in an extended graph. Finally, we discuss the consequences of our results and some potential applications of the methods into other resolvable decomposition problems.","abstract_html":"Given graphs \\(F\\) and \\(G\\), a resolvable \\(F\\)-decomposition of \\(G\\) is a partition of its edges into \\(F\\)-factors. We study the existence of resolvable cycle and clique decompositions in graphs with high minimum degree and pseudo-random graphs. We show a Dirac-type result for the uniform case of the Oberwolfach problem and make progress towards a conjecture by Glock, Joos, Kim, Kühn and Osthus. Specifically, we prove that for any <span class=\"etd-inline-math\">&alpha;&gt;0</span> there is an integer <span class=\"etd-inline-math\">r<sub>0</sub></span> such that for any <span class=\"etd-inline-math\">r\\geq r<sub>0</sub></span>, any sufficiently large graph \\(G\\) on \\(n\\) vertices, with \\(r\\mid n\\), even degree, and minimum degree <span class=\"etd-inline-math\">(1/2+&alpha;)n</span>, has a resolvable <span class=\"etd-inline-math\">C<sub>r</sub></span>-decomposition. The term \\(1/2\\) in the minimum degree bound is best possible. We show that any sufficiently large pseudo-random graph that satisfies the necessary divisibility conditions has a resolvable <span class=\"etd-inline-math\">K<sub>r</sub></span>-decomposition. We also prove the analogue for multipartite graphs. That is, any sufficiently large \\(r\\)-partite pseudo-random graph that satisfies the necessary divisibility conditions has a resolvable <span class=\"etd-inline-math\">K<sub>r</sub></span>-decomposition. Our methods are purely combinatorial and combine iterative absorption with a new technique on finding a fractional decomposition in an extended graph. Finally, we discuss the consequences of our results and some potential applications of the methods into other resolvable decomposition problems.","abstract_has_math":true,"creators":["Oviedo Timoneda, Pablo"],"institution":"University of Birmingham","degree_name":"d_ph","degree_level":"d_ph","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-12","date_published":"2024-12","updated_at":"2026-11-19T09:32:59Z","subjects":["QA Mathematics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"http://etheses.bham.ac.uk//id/eprint/15642/7/OviedoTimoneda2024PhD.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://etheses.bham.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Aetheses.bham.ac.uk%3A15642","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["erc"]},{"key":"dc:creator","label":"Author","values":["Oviedo Timoneda, Pablo"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2024-12-10"]},{"key":"dc:date.issued","label":"Date","values":["2024-12"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["College of Engineering & Physical Sciences","School of Mathematics"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Birmingham"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["http://etheses.bham.ac.uk//id/eprint/15642/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["d_ph"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["d_ph"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QA Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.dcterms_iso639_2","label":"Language (ISO 639-2)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://etheses.bham.ac.uk//id/eprint/15642/7/OviedoTimoneda2024PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Given graphs \\(F\\) and \\(G\\), a resolvable \\(F\\)-decomposition of \\(G\\) is a partition of its edges into \\(F\\)-factors. We study the existence of resolvable cycle and clique decompositions in graphs with high minimum degree and pseudo-random graphs. We show a Dirac-type result for the uniform case of the Oberwolfach problem and make progress towards a conjecture by Glock, Joos, Kim, Kühn and Osthus. Specifically, we prove that for any \\(\\alpha>0\\) there is an integer \\(r_0\\) such that for any \\(r\\geq r_0\\), any sufficiently large graph \\(G\\) on \\(n\\) vertices, with \\(r\\mid n\\), even degree, and minimum degree \\((1/2+\\alpha)n\\), has a resolvable \\(C_r\\)-decomposition. The term \\(1/2\\) in the minimum degree bound is best possible. We show that any sufficiently large pseudo-random graph that satisfies the necessary divisibility conditions has a resolvable \\(K_r\\)-decomposition. We also prove the analogue for multipartite graphs. That is, any sufficiently large \\(r\\)-partite pseudo-random graph that satisfies the necessary divisibility conditions has a resolvable \\(K_r\\)-decomposition. Our methods are purely combinatorial and combine iterative absorption with a new technique on finding a fractional decomposition in an extended graph. Finally, we discuss the consequences of our results and some potential applications of the methods into other resolvable decomposition problems."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["On resolvable decomposition problems"]}]}],"canonical_facts":{"dc:contributor.sponsor":["erc"],"dc:creator":["Oviedo Timoneda, Pablo"],"dc:date":["2024-12-10"],"dc:date.issued":["2024-12"],"dc:description.abstract":["Given graphs \\(F\\) and \\(G\\), a resolvable \\(F\\)-decomposition of \\(G\\) is a partition of its edges into \\(F\\)-factors. We study the existence of resolvable cycle and clique decompositions in graphs with high minimum degree and pseudo-random graphs. We show a Dirac-type result for the uniform case of the Oberwolfach problem and make progress towards a conjecture by Glock, Joos, Kim, Kühn and Osthus. Specifically, we prove that for any \\(\\alpha>0\\) there is an integer \\(r_0\\) such that for any \\(r\\geq r_0\\), any sufficiently large graph \\(G\\) on \\(n\\) vertices, with \\(r\\mid n\\), even degree, and minimum degree \\((1/2+\\alpha)n\\), has a resolvable \\(C_r\\)-decomposition. The term \\(1/2\\) in the minimum degree bound is best possible. We show that any sufficiently large pseudo-random graph that satisfies the necessary divisibility conditions has a resolvable \\(K_r\\)-decomposition. We also prove the analogue for multipartite graphs. That is, any sufficiently large \\(r\\)-partite pseudo-random graph that satisfies the necessary divisibility conditions has a resolvable \\(K_r\\)-decomposition. Our methods are purely combinatorial and combine iterative absorption with a new technique on finding a fractional decomposition in an extended graph. Finally, we discuss the consequences of our results and some potential applications of the methods into other resolvable decomposition problems."],"dc:format":["text"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/15642/7/OviedoTimoneda2024PhD.pdf"],"dc:language.dcterms_iso639_2":["eng"],"dc:publisher.department":["College of Engineering & Physical Sciences","School of Mathematics"],"dc:publisher.institution":["University of Birmingham"],"dc:relation.isreferencedby":["http://etheses.bham.ac.uk//id/eprint/15642/"],"dc:subject":["QA Mathematics"],"dcterms:accessrights":["public"],"dc:title":["On resolvable decomposition problems"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:32:59Z"}