{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:13250"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:13250","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Paths and cycles in graphs and hypergraphs","abstract":"In this thesis we present new results in graph and hypergraph theory all of which feature paths or cycles. A \\(k\\)-uniform tight cycle \\(C^{(k)}_n\\) is a \\(k\\)-uniform hypergraph on \\(n\\) vertices with a cyclic ordering of its vertices such that the edges are all \\(k\\)-sets of consecutive vertices in the ordering. We consider a generalisation of Lehel's Conjecture, which states that every 2-edge-coloured complete graph can be partitioned into two cycles of distinct colour, to \\(k\\)-uniform hypergraphs and prove results in the 4- and 5-uniform case. For a \\(k\\)-uniform hypergraph~\\(H\\), the Ramsey number \\({r(H)}\\) is the smallest integer \\(N\\) such that any 2-edge-colouring of the complete \\(k\\)-uniform hypergraph on \\(N\\) vertices contains a monochromatic copy of \\(H\\). We determine the Ramsey number for 4-uniform tight cycles asymptotically in the case where the length of the cycle is divisible by 4, by showing that \\(r(C^{(4)}_n)\\) = (5+\\(o\\)(1))\\(n\\). We prove a resilience result for tight Hamiltonicity in random hypergraphs. More precisely, we show that for any \\(\\gamma\\) >0 and \\(k\\) \\(\\geq\\) 3 asymptotically almost surely, every subgraph of the binomial random \\(k\\)-uniform hypergraph \\(G^{(k)}(n, n^{\\gamma -1})\\) in which all \\((k-1)\\)-sets are contained in at least \\((\\frac{1}{2}+2\\gamma)pn\\) edges has a tight Hamilton cycle. A random graph model on a host graph \\(H\\) is said to be 1-independent if for every pair of vertex-disjoint subsets \\(A,B\\) of \\(E(H)\\), the state of edges (absent or present) in \\(A\\) is independent of the state of edges in \\(B\\). We show that \\(p\\) = 4 - 2\\(\\sqrt{3}\\) is the critical probability such that every 1-independent graph model on \\(\\mathbb{Z}^2 \\times K_n\\) where each edge is present with probability at least \\(p\\) contains an infinite path.","abstract_html":"In this thesis we present new results in graph and hypergraph theory all of which feature paths or cycles. A \\(k\\)-uniform tight cycle <span class=\"etd-inline-math\">C<sup>(k)</sup><sub>n</sub></span> is a \\(k\\)-uniform hypergraph on \\(n\\) vertices with a cyclic ordering of its vertices such that the edges are all \\(k\\)-sets of consecutive vertices in the ordering. We consider a generalisation of Lehel&#x27;s Conjecture, which states that every 2-edge-coloured complete graph can be partitioned into two cycles of distinct colour, to \\(k\\)-uniform hypergraphs and prove results in the 4- and 5-uniform case. For a \\(k\\)-uniform hypergraph~\\(H\\), the Ramsey number \\({r(H)}\\) is the smallest integer \\(N\\) such that any 2-edge-colouring of the complete \\(k\\)-uniform hypergraph on \\(N\\) vertices contains a monochromatic copy of \\(H\\). We determine the Ramsey number for 4-uniform tight cycles asymptotically in the case where the length of the cycle is divisible by 4, by showing that <span class=\"etd-inline-math\">r(C<sup>(4)</sup><sub>n</sub>)</span> = (5+\\(o\\)(1))\\(n\\). We prove a resilience result for tight Hamiltonicity in random hypergraphs. More precisely, we show that for any <span class=\"etd-inline-math\">&gamma;</span> &gt;0 and \\(k\\) \\(\\geq\\) 3 asymptotically almost surely, every subgraph of the binomial random \\(k\\)-uniform hypergraph <span class=\"etd-inline-math\">G<sup>(k)</sup>(n, n<sup>&gamma; -1</sup>)</span> in which all \\((k-1)\\)-sets are contained in at least <span class=\"etd-inline-math\">(\\frac{1}{2}+2&gamma;)pn</span> edges has a tight Hamilton cycle. A random graph model on a host graph \\(H\\) is said to be 1-independent if for every pair of vertex-disjoint subsets \\(A,B\\) of \\(E(H)\\), the state of edges (absent or present) in \\(A\\) is independent of the state of edges in \\(B\\). We show that \\(p\\) = 4 - 2\\(\\sqrt{3}\\) is the critical probability such that every 1-independent graph model on <span class=\"etd-inline-math\">\\mathbb{Z}<sup>2</sup> \\times K<sub>n</sub></span> where each edge is present with probability at least \\(p\\) contains an infinite path.","abstract_has_math":true,"creators":["Pfenninger, Vincent"],"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:14Z","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/13250/7/Pfenninger2023PhD.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%3A13250","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["epsrc"]},{"key":"dc:creator","label":"Author","values":["Pfenninger, Vincent"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2023-07"]},{"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/13250/"]},{"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/13250/7/Pfenninger2023PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis we present new results in graph and hypergraph theory all of which feature paths or cycles. A \\(k\\)-uniform tight cycle \\(C^{(k)}_n\\) is a \\(k\\)-uniform hypergraph on \\(n\\) vertices with a cyclic ordering of its vertices such that the edges are all \\(k\\)-sets of consecutive vertices in the ordering. We consider a generalisation of Lehel's Conjecture, which states that every 2-edge-coloured complete graph can be partitioned into two cycles of distinct colour, to \\(k\\)-uniform hypergraphs and prove results in the 4- and 5-uniform case. For a \\(k\\)-uniform hypergraph~\\(H\\), the Ramsey number \\({r(H)}\\) is the smallest integer \\(N\\) such that any 2-edge-colouring of the complete \\(k\\)-uniform hypergraph on \\(N\\) vertices contains a monochromatic copy of \\(H\\). We determine the Ramsey number for 4-uniform tight cycles asymptotically in the case where the length of the cycle is divisible by 4, by showing that \\(r(C^{(4)}_n)\\) = (5+\\(o\\)(1))\\(n\\). We prove a resilience result for tight Hamiltonicity in random hypergraphs. More precisely, we show that for any \\(\\gamma\\) >0 and \\(k\\) \\(\\geq\\) 3 asymptotically almost surely, every subgraph of the binomial random \\(k\\)-uniform hypergraph \\(G^{(k)}(n, n^{\\gamma -1})\\) in which all \\((k-1)\\)-sets are contained in at least \\((\\frac{1}{2}+2\\gamma)pn\\) edges has a tight Hamilton cycle. A random graph model on a host graph \\(H\\) is said to be 1-independent if for every pair of vertex-disjoint subsets \\(A,B\\) of \\(E(H)\\), the state of edges (absent or present) in \\(A\\) is independent of the state of edges in \\(B\\). We show that \\(p\\) = 4 - 2\\(\\sqrt{3}\\) is the critical probability such that every 1-independent graph model on \\(\\mathbb{Z}^2 \\times K_n\\) where each edge is present with probability at least \\(p\\) contains an infinite path."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Paths and cycles in graphs and hypergraphs"]}]}],"canonical_facts":{"dc:contributor.sponsor":["epsrc"],"dc:creator":["Pfenninger, Vincent"],"dc:date":["2023-07"],"dc:date.issued":["2023-07"],"dc:description.abstract":["In this thesis we present new results in graph and hypergraph theory all of which feature paths or cycles. A \\(k\\)-uniform tight cycle \\(C^{(k)}_n\\) is a \\(k\\)-uniform hypergraph on \\(n\\) vertices with a cyclic ordering of its vertices such that the edges are all \\(k\\)-sets of consecutive vertices in the ordering. We consider a generalisation of Lehel's Conjecture, which states that every 2-edge-coloured complete graph can be partitioned into two cycles of distinct colour, to \\(k\\)-uniform hypergraphs and prove results in the 4- and 5-uniform case. For a \\(k\\)-uniform hypergraph~\\(H\\), the Ramsey number \\({r(H)}\\) is the smallest integer \\(N\\) such that any 2-edge-colouring of the complete \\(k\\)-uniform hypergraph on \\(N\\) vertices contains a monochromatic copy of \\(H\\). We determine the Ramsey number for 4-uniform tight cycles asymptotically in the case where the length of the cycle is divisible by 4, by showing that \\(r(C^{(4)}_n)\\) = (5+\\(o\\)(1))\\(n\\). We prove a resilience result for tight Hamiltonicity in random hypergraphs. More precisely, we show that for any \\(\\gamma\\) >0 and \\(k\\) \\(\\geq\\) 3 asymptotically almost surely, every subgraph of the binomial random \\(k\\)-uniform hypergraph \\(G^{(k)}(n, n^{\\gamma -1})\\) in which all \\((k-1)\\)-sets are contained in at least \\((\\frac{1}{2}+2\\gamma)pn\\) edges has a tight Hamilton cycle. A random graph model on a host graph \\(H\\) is said to be 1-independent if for every pair of vertex-disjoint subsets \\(A,B\\) of \\(E(H)\\), the state of edges (absent or present) in \\(A\\) is independent of the state of edges in \\(B\\). We show that \\(p\\) = 4 - 2\\(\\sqrt{3}\\) is the critical probability such that every 1-independent graph model on \\(\\mathbb{Z}^2 \\times K_n\\) where each edge is present with probability at least \\(p\\) contains an infinite path."],"dc:format":["text"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/13250/7/Pfenninger2023PhD.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/13250/"],"dc:subject":["QA Mathematics"],"dcterms:accessrights":["public"],"dc:title":["Paths and cycles in graphs and hypergraphs"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:32:14Z"}