{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:13854"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:13854","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Hamilton cycles in large graphs and hypergraphs: existence and counting","abstract":"The study of Hamilton cycles forms a central part of classical graph theory. In this thesis we present our contribution to the modern research on this topic. In Chapter 2, we prove that \\( k \\)-uniform hypergraphs satisfying a `Dirac-like' condition on the minimum \\( (k-1) \\)-degree contain many of a natural hypergraph analogue of a Hamilton cycle. In Chapter 3, we show that almost all optimal edge-colourings of \\( K_{n} \\) admit a Hamilton path whose edges all have distinct colours; that is, a rainbow Hamilton path. If \\( n \\) is odd, we show that one is further able to find a rainbow Hamilton cycle. Chapter 4 is given to the proof that almost all optimal colourings of a directed analogue of \\( K_{n} \\) we call \\( \\overleftrightarrow{K_{n}} \\) admit many rainbow directed Hamilton cycles; equivalently, almost all \\( n\\times n \\) Latin squares contain many structures we call `Hamilton transversals'. Finally, in Chapter 5 we introduce an upcoming result which combines the R\\\"{o}dl Nibble with the Polynomial Method to substantially improve upon known results on the size of matchings in almost-regular hypergaphs. We also state an application of this result to the problem of finding rainbow almost-Hamilton directed cycles in any optimal colouring of \\( \\overleftrightarrow{K_{n}} \\).","abstract_html":"The study of Hamilton cycles forms a central part of classical graph theory. In this thesis we present our contribution to the modern research on this topic. In Chapter 2, we prove that \\( k \\)-uniform hypergraphs satisfying a `Dirac-like&#x27; condition on the minimum \\( (k-1) \\)-degree contain many of a natural hypergraph analogue of a Hamilton cycle. In Chapter 3, we show that almost all optimal edge-colourings of <span class=\"etd-inline-math\"> K<sub>n</sub> </span> admit a Hamilton path whose edges all have distinct colours; that is, a rainbow Hamilton path. If \\( n \\) is odd, we show that one is further able to find a rainbow Hamilton cycle. Chapter 4 is given to the proof that almost all optimal colourings of a directed analogue of <span class=\"etd-inline-math\"> K<sub>n</sub> </span> we call <span class=\"etd-inline-math\"> \\overleftrightarrow{K<sub>n</sub>} </span> admit many rainbow directed Hamilton cycles; equivalently, almost all \\( n\\times n \\) Latin squares contain many structures we call `Hamilton transversals&#x27;. Finally, in Chapter 5 we introduce an upcoming result which combines the R\\&quot;{o}dl Nibble with the Polynomial Method to substantially improve upon known results on the size of matchings in almost-regular hypergaphs. We also state an application of this result to the problem of finding rainbow almost-Hamilton directed cycles in any optimal colouring of <span class=\"etd-inline-math\"> \\overleftrightarrow{K<sub>n</sub>} </span>.","abstract_has_math":true,"creators":["Gould, Stephen"],"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":2023,"date_issued":"2023-07","date_published":"2023-07","updated_at":"2026-11-19T09:32:22Z","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/13854/7/Gould2023PhD.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%3A13854","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["epsrc"]},{"key":"dc:creator","label":"Author","values":["Gould, Stephen"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2023-07-12"]},{"key":"dc:date.issued","label":"Date","values":["2023-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/13854/"]},{"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/13854/7/Gould2023PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The study of Hamilton cycles forms a central part of classical graph theory. In this thesis we present our contribution to the modern research on this topic. In Chapter 2, we prove that \\( k \\)-uniform hypergraphs satisfying a `Dirac-like' condition on the minimum \\( (k-1) \\)-degree contain many of a natural hypergraph analogue of a Hamilton cycle. In Chapter 3, we show that almost all optimal edge-colourings of \\( K_{n} \\) admit a Hamilton path whose edges all have distinct colours; that is, a rainbow Hamilton path. If \\( n \\) is odd, we show that one is further able to find a rainbow Hamilton cycle. Chapter 4 is given to the proof that almost all optimal colourings of a directed analogue of \\( K_{n} \\) we call \\( \\overleftrightarrow{K_{n}} \\) admit many rainbow directed Hamilton cycles; equivalently, almost all \\( n\\times n \\) Latin squares contain many structures we call `Hamilton transversals'. Finally, in Chapter 5 we introduce an upcoming result which combines the R\\\"{o}dl Nibble with the Polynomial Method to substantially improve upon known results on the size of matchings in almost-regular hypergaphs. We also state an application of this result to the problem of finding rainbow almost-Hamilton directed cycles in any optimal colouring of \\( \\overleftrightarrow{K_{n}} \\)."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Hamilton cycles in large graphs and hypergraphs: existence and counting"]}]}],"canonical_facts":{"dc:contributor.sponsor":["epsrc"],"dc:creator":["Gould, Stephen"],"dc:date":["2023-07-12"],"dc:date.issued":["2023-07"],"dc:description.abstract":["The study of Hamilton cycles forms a central part of classical graph theory. In this thesis we present our contribution to the modern research on this topic. In Chapter 2, we prove that \\( k \\)-uniform hypergraphs satisfying a `Dirac-like' condition on the minimum \\( (k-1) \\)-degree contain many of a natural hypergraph analogue of a Hamilton cycle. In Chapter 3, we show that almost all optimal edge-colourings of \\( K_{n} \\) admit a Hamilton path whose edges all have distinct colours; that is, a rainbow Hamilton path. If \\( n \\) is odd, we show that one is further able to find a rainbow Hamilton cycle. Chapter 4 is given to the proof that almost all optimal colourings of a directed analogue of \\( K_{n} \\) we call \\( \\overleftrightarrow{K_{n}} \\) admit many rainbow directed Hamilton cycles; equivalently, almost all \\( n\\times n \\) Latin squares contain many structures we call `Hamilton transversals'. Finally, in Chapter 5 we introduce an upcoming result which combines the R\\\"{o}dl Nibble with the Polynomial Method to substantially improve upon known results on the size of matchings in almost-regular hypergaphs. We also state an application of this result to the problem of finding rainbow almost-Hamilton directed cycles in any optimal colouring of \\( \\overleftrightarrow{K_{n}} \\)."],"dc:format":["text"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/13854/7/Gould2023PhD.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/13854/"],"dc:subject":["QA Mathematics"],"dcterms:accessrights":["public"],"dc:title":["Hamilton cycles in large graphs and hypergraphs: existence and counting"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:32:22Z"}