{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:10352"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:10352","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Local approaches to global problems in extremal combinatorics","abstract":"In this thesis we consider five problems in extremal combinatorics all of which which are all amenable to approaches based on local structure. The first part of this thesis looks at rainbow subgraphs at extremal thresholds. We show that as soon as they appear, we can also find rainbow copies of Perfect Matchings, H-factors and Hamilton cycles in large graphs. We then look to random digraphs and consider the D(n, p) model in which each edge is present independently with probability p. We find tail bounds on the size of the largest strongly connected component in the critical window around p = 1/n. Finally, we consider the partition function of the ferromagnetic Potts model on graphs of bounded maximum degree. We show that there exists an open set in C containing an interval [1, w] inside which the partition function has no zeros.","abstract_html":"In this thesis we consider five problems in extremal combinatorics all of which which are all amenable to approaches based on local structure. The first part of this thesis looks at rainbow subgraphs at extremal thresholds. We show that as soon as they appear, we can also find rainbow copies of Perfect Matchings, H-factors and Hamilton cycles in large graphs. We then look to random digraphs and consider the D(n, p) model in which each edge is present independently with probability p. We find tail bounds on the size of the largest strongly connected component in the critical window around p = 1/n. Finally, we consider the partition function of the ferromagnetic Potts model on graphs of bounded maximum degree. We show that there exists an open set in C containing an interval [1, w] inside which the partition function has no zeros.","abstract_has_math":false,"creators":["Coulson, Matthew"],"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":2020,"date_issued":"2020-07","date_published":"2020-07","updated_at":"2026-11-19T09:31:05Z","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/10352/7/Coulson2020PhD.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%3A10352","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["epsrc"]},{"key":"dc:creator","label":"Author","values":["Coulson, Matthew"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2020-07-01"]},{"key":"dc:date.issued","label":"Date","values":["2020-07"]},{"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/10352/"]},{"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/10352/7/Coulson2020PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis we consider five problems in extremal combinatorics all of which which are all amenable to approaches based on local structure. The first part of this thesis looks at rainbow subgraphs at extremal thresholds. We show that as soon as they appear, we can also find rainbow copies of Perfect Matchings, H-factors and Hamilton cycles in large graphs. We then look to random digraphs and consider the D(n, p) model in which each edge is present independently with probability p. We find tail bounds on the size of the largest strongly connected component in the critical window around p = 1/n. Finally, we consider the partition function of the ferromagnetic Potts model on graphs of bounded maximum degree. We show that there exists an open set in C containing an interval [1, w] inside which the partition function has no zeros."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Local approaches to global problems in extremal combinatorics"]}]}],"canonical_facts":{"dc:contributor.sponsor":["epsrc"],"dc:creator":["Coulson, Matthew"],"dc:date":["2020-07-01"],"dc:date.issued":["2020-07"],"dc:description.abstract":["In this thesis we consider five problems in extremal combinatorics all of which which are all amenable to approaches based on local structure. The first part of this thesis looks at rainbow subgraphs at extremal thresholds. We show that as soon as they appear, we can also find rainbow copies of Perfect Matchings, H-factors and Hamilton cycles in large graphs. We then look to random digraphs and consider the D(n, p) model in which each edge is present independently with probability p. We find tail bounds on the size of the largest strongly connected component in the critical window around p = 1/n. Finally, we consider the partition function of the ferromagnetic Potts model on graphs of bounded maximum degree. We show that there exists an open set in C containing an interval [1, w] inside which the partition function has no zeros."],"dc:format":["text"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/10352/7/Coulson2020PhD.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/10352/"],"dc:subject":["QA Mathematics"],"dcterms:accessrights":["public"],"dc:title":["Local approaches to global problems in extremal combinatorics"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:31:05Z"}