{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:9999"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:9999","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Extremal results in hypergraph theory via the absorption method","abstract":"The so-called \"absorbing method\" was first introduced in a systematic way by Rödl, Ruciński and Szemerédi in 2006, and has found many uses ever since. Speaking in a general sense, it is useful for finding spanning substructures of combinatorial structures. We establish various results of different natures, in both graph and hypergraph theory, most of them using the absorbing method: 1. We prove an asymptotically best-possible bound on the strong chromatic number with respect to the maximum degree of the graph. This establishes a weak version of a conjecture of Aharoni, Berger and Ziv. 2. We determine asymptotic minimum codegree thresholds which ensure the existence of tilings with tight cycles (of a given size) in uniform hypergraphs. Moreover, we prove results on coverings with tight cycles. 3. We show that every 2-coloured complete graph on the integers contains a monochromatic infinite path whose vertex set is sufficiently \"dense\" in the natural numbers. This improves results of Galvin and Erdős and of DeBiasio and McKenney.","abstract_html":"The so-called &quot;absorbing method&quot; was first introduced in a systematic way by Rödl, Ruciński and Szemerédi in 2006, and has found many uses ever since. Speaking in a general sense, it is useful for finding spanning substructures of combinatorial structures. We establish various results of different natures, in both graph and hypergraph theory, most of them using the absorbing method: 1. We prove an asymptotically best-possible bound on the strong chromatic number with respect to the maximum degree of the graph. This establishes a weak version of a conjecture of Aharoni, Berger and Ziv. 2. We determine asymptotic minimum codegree thresholds which ensure the existence of tilings with tight cycles (of a given size) in uniform hypergraphs. Moreover, we prove results on coverings with tight cycles. 3. We show that every 2-coloured complete graph on the integers contains a monochromatic infinite path whose vertex set is sufficiently &quot;dense&quot; in the natural numbers. This improves results of Galvin and Erdős and of DeBiasio and McKenney.","abstract_has_math":false,"creators":["Sanhueza Matamala, Nicolás"],"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:30:56Z","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/9999/1/SanhuezaMatamalaPhD2020.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%3A9999","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["other"]},{"key":"dc:creator","label":"Author","values":["Sanhueza Matamala, Nicolás"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2020-07"]},{"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/9999/"]},{"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/9999/1/SanhuezaMatamalaPhD2020.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The so-called \"absorbing method\" was first introduced in a systematic way by Rödl, Ruciński and Szemerédi in 2006, and has found many uses ever since. Speaking in a general sense, it is useful for finding spanning substructures of combinatorial structures. We establish various results of different natures, in both graph and hypergraph theory, most of them using the absorbing method: 1. We prove an asymptotically best-possible bound on the strong chromatic number with respect to the maximum degree of the graph. This establishes a weak version of a conjecture of Aharoni, Berger and Ziv. 2. We determine asymptotic minimum codegree thresholds which ensure the existence of tilings with tight cycles (of a given size) in uniform hypergraphs. Moreover, we prove results on coverings with tight cycles. 3. We show that every 2-coloured complete graph on the integers contains a monochromatic infinite path whose vertex set is sufficiently \"dense\" in the natural numbers. This improves results of Galvin and Erdős and of DeBiasio and McKenney."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Extremal results in hypergraph theory via the absorption method"]}]}],"canonical_facts":{"dc:contributor.sponsor":["other"],"dc:creator":["Sanhueza Matamala, Nicolás"],"dc:date":["2020-07"],"dc:date.issued":["2020-07"],"dc:description.abstract":["The so-called \"absorbing method\" was first introduced in a systematic way by Rödl, Ruciński and Szemerédi in 2006, and has found many uses ever since. Speaking in a general sense, it is useful for finding spanning substructures of combinatorial structures. We establish various results of different natures, in both graph and hypergraph theory, most of them using the absorbing method: 1. We prove an asymptotically best-possible bound on the strong chromatic number with respect to the maximum degree of the graph. This establishes a weak version of a conjecture of Aharoni, Berger and Ziv. 2. We determine asymptotic minimum codegree thresholds which ensure the existence of tilings with tight cycles (of a given size) in uniform hypergraphs. Moreover, we prove results on coverings with tight cycles. 3. We show that every 2-coloured complete graph on the integers contains a monochromatic infinite path whose vertex set is sufficiently \"dense\" in the natural numbers. This improves results of Galvin and Erdős and of DeBiasio and McKenney."],"dc:format":["text"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/9999/1/SanhuezaMatamalaPhD2020.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/9999/"],"dc:subject":["QA Mathematics"],"dcterms:accessrights":["public"],"dc:title":["Extremal results in hypergraph theory via the absorption method"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:30:56Z"}