{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:12068"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:12068","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Extremal problems in graphs","abstract":"In the first part of this thesis we will consider degree sequence results for graphs. An important result of Komlós [39] yields the asymptotically exact minimum degree threshold that ensures a graph \\(G\\) contains an \\(H\\)-tiling covering an \\(x\\)-proportion of the vertices of \\(G\\) (for any fixed \\(x ∈\\) (0, 1) and graph \\(H\\)). In Chapter 2, we give a degree sequence strengthening of this result. A fundamental result of Kühn and Osthus [46] determines up to an additive constant the minimum degree threshold that forces a graph to contain a perfect \\(H\\)-tiling. In Chapter 3, we prove a degree sequence version of this result. We close this thesis in the study of asymmetric Ramsey properties in \\(G_n,_p\\). Specifically, for fixed graphs \\(H_1, . . . , H_r,\\) we study the asymptotic threshold function for the property \\(G_n,_p\\) → \\(H_1, . . . , H_r\\). Rödl and Ruciński [61, 62, 63] determined the threshold function for the general symmetric case; that is, when \\(H_1 = · · · = H_r\\). Kohayakawa and Kreuter [33] conjectured the threshold function for the asymmetric case. Building on work of Marciniszyn, Skokan, Spöhel and Steger [51], in Chapter 4, we reduce the 0-statement of Kohayakawa and Kreuter’s conjecture to a more approachable, deterministic conjecture. To demonstrate the potential of this approach, we show our conjecture holds for almost all pairs of regular graphs (satisfying certain balancedness conditions).","abstract_html":"In the first part of this thesis we will consider degree sequence results for graphs. An important result of Komlós [39] yields the asymptotically exact minimum degree threshold that ensures a graph \\(G\\) contains an \\(H\\)-tiling covering an \\(x\\)-proportion of the vertices of \\(G\\) (for any fixed \\(x ∈\\) (0, 1) and graph \\(H\\)). In Chapter 2, we give a degree sequence strengthening of this result. A fundamental result of Kühn and Osthus [46] determines up to an additive constant the minimum degree threshold that forces a graph to contain a perfect \\(H\\)-tiling. In Chapter 3, we prove a degree sequence version of this result. We close this thesis in the study of asymmetric Ramsey properties in <span class=\"etd-inline-math\">G<sub>n</sub>,<sub>p</sub></span>. Specifically, for fixed graphs <span class=\"etd-inline-math\">H<sub>1</sub>, . . . , H<sub>r</sub>,</span> we study the asymptotic threshold function for the property <span class=\"etd-inline-math\">G<sub>n</sub>,<sub>p</sub></span> → <span class=\"etd-inline-math\">H<sub>1</sub>, . . . , H<sub>r</sub></span>. Rödl and Ruciński [61, 62, 63] determined the threshold function for the general symmetric case; that is, when <span class=\"etd-inline-math\">H<sub>1</sub> = · · · = H<sub>r</sub></span>. Kohayakawa and Kreuter [33] conjectured the threshold function for the asymmetric case. Building on work of Marciniszyn, Skokan, Spöhel and Steger [51], in Chapter 4, we reduce the 0-statement of Kohayakawa and Kreuter’s conjecture to a more approachable, deterministic conjecture. To demonstrate the potential of this approach, we show our conjecture holds for almost all pairs of regular graphs (satisfying certain balancedness conditions).","abstract_has_math":true,"creators":["Hyde, Joseph Frederick"],"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":2021,"date_issued":"2021-12","date_published":"2021-12","updated_at":"2026-11-19T09:31:36Z","subjects":["QA Mathematics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.grantnumber","label":"Dc Identifier Grantnumber","values":["Extremal problems for graphs and the integers - 1935869"],"render_values":[{"text":"Extremal problems for graphs and the integers - 1935869","href":null,"code":true}]}],"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/12068/1/Hyde2021PhD.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%3A12068","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["epsrc"]},{"key":"dc:creator","label":"Author","values":["Hyde, Joseph Frederick"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2021-12"]},{"key":"dc:date.issued","label":"Date","values":["2021-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/12068/"]},{"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.grantnumber","label":"Dc Identifier Grantnumber","values":["Extremal problems for graphs and the integers - 1935869"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://etheses.bham.ac.uk//id/eprint/12068/1/Hyde2021PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In the first part of this thesis we will consider degree sequence results for graphs. An important result of Komlós [39] yields the asymptotically exact minimum degree threshold that ensures a graph \\(G\\) contains an \\(H\\)-tiling covering an \\(x\\)-proportion of the vertices of \\(G\\) (for any fixed \\(x ∈\\) (0, 1) and graph \\(H\\)). In Chapter 2, we give a degree sequence strengthening of this result. A fundamental result of Kühn and Osthus [46] determines up to an additive constant the minimum degree threshold that forces a graph to contain a perfect \\(H\\)-tiling. In Chapter 3, we prove a degree sequence version of this result. We close this thesis in the study of asymmetric Ramsey properties in \\(G_n,_p\\). Specifically, for fixed graphs \\(H_1, . . . , H_r,\\) we study the asymptotic threshold function for the property \\(G_n,_p\\) → \\(H_1, . . . , H_r\\). Rödl and Ruciński [61, 62, 63] determined the threshold function for the general symmetric case; that is, when \\(H_1 = · · · = H_r\\). Kohayakawa and Kreuter [33] conjectured the threshold function for the asymmetric case. Building on work of Marciniszyn, Skokan, Spöhel and Steger [51], in Chapter 4, we reduce the 0-statement of Kohayakawa and Kreuter’s conjecture to a more approachable, deterministic conjecture. To demonstrate the potential of this approach, we show our conjecture holds for almost all pairs of regular graphs (satisfying certain balancedness conditions)."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Extremal problems in graphs"]}]}],"canonical_facts":{"dc:contributor.sponsor":["epsrc"],"dc:creator":["Hyde, Joseph Frederick"],"dc:date":["2021-12"],"dc:date.issued":["2021-12"],"dc:description.abstract":["In the first part of this thesis we will consider degree sequence results for graphs. An important result of Komlós [39] yields the asymptotically exact minimum degree threshold that ensures a graph \\(G\\) contains an \\(H\\)-tiling covering an \\(x\\)-proportion of the vertices of \\(G\\) (for any fixed \\(x ∈\\) (0, 1) and graph \\(H\\)). In Chapter 2, we give a degree sequence strengthening of this result. A fundamental result of Kühn and Osthus [46] determines up to an additive constant the minimum degree threshold that forces a graph to contain a perfect \\(H\\)-tiling. In Chapter 3, we prove a degree sequence version of this result. We close this thesis in the study of asymmetric Ramsey properties in \\(G_n,_p\\). Specifically, for fixed graphs \\(H_1, . . . , H_r,\\) we study the asymptotic threshold function for the property \\(G_n,_p\\) → \\(H_1, . . . , H_r\\). Rödl and Ruciński [61, 62, 63] determined the threshold function for the general symmetric case; that is, when \\(H_1 = · · · = H_r\\). Kohayakawa and Kreuter [33] conjectured the threshold function for the asymmetric case. Building on work of Marciniszyn, Skokan, Spöhel and Steger [51], in Chapter 4, we reduce the 0-statement of Kohayakawa and Kreuter’s conjecture to a more approachable, deterministic conjecture. To demonstrate the potential of this approach, we show our conjecture holds for almost all pairs of regular graphs (satisfying certain balancedness conditions)."],"dc:format":["text"],"dc:identifier.grantnumber":["Extremal problems for graphs and the integers - 1935869"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/12068/1/Hyde2021PhD.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/12068/"],"dc:subject":["QA Mathematics"],"dcterms:accessrights":["public"],"dc:title":["Extremal problems in graphs"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:31:36Z"}