Previous PhD students

Members of the Combinatorics Group have supervised a number of PhD students over the years.

A list of those students who have submitted theses to the University repository are below. (Some have not done this and they are not listed here.)

• Alistair Benford (2023). On the appearance of oriented trees in tournaments. Supervisors: Richard Montgomery and Andrew Treglown.
• Jordan Chellig (2023). Communities and competition in random networks. Supervisor: Nikolaos Fountoulakis.
• Stephen Gould (2023). Hamilton cycles in large graphs and hypergraphs: existence and counting. Supervisors: Deryk Osthus and Daniela Kühn
• Amarja Kathapurkar (2023). Spanning and induced subgraphs in graphs and digraphs. Supervisor: Richard Mycroft.
• Vincent Pfenninger (2023). Paths and cycles in graphs and hypergraphs. Supervisor: Allan Lo.
• Bertille Granet (2022). Path and cycle decompositions of graphs and digraphs. Supervisors: Daniela Kühn and Deryk Osthus.
• Joseph Hyde (2021). Extremal problems in graphs. Supervisor: Andrew Treglown.
• Tejas Iyer (2021). Evolving Inhomogeneous Random Structures. Supervisor: Nikolaos Fountoulakis.
• Padraig Condon (2020). Packing and embedding large subgraphs. Supervisor: Deryk Osthus.
• Matthew Coulson (2020). Local approaches to global problems in extremal combinatorics. Supervisor: Guillem Perarnau.
• Alberto Espuny Díaz (2020). Hamiltonicity problems in random graphs. Supervisor: Daniela Kühn.
• Nicolás Sanhueza Matamala (2020). Extremal results in hypergraph theory via the absorption method. Supervisor: Allan Lo.
• Robert Arthur Hancock (2019). Independence and counting problems in Combinatorics and Number theory. Supervisor: Andrew Treglown.
• Frederik Garbe (2018). Extremal graph theory via structural analysis. Supervisor: Richard Mycroft.
• Stefan Glock (2018). Decompositions of graphs and hypergraphs. Supervisor: Deryk Osthus.
• Tássio Naia dos Santos (2018). Large structures in dense directed graphs. Supervisor: Richard Mycroft.
• Wei En Tan (2017). Waiter–Client and Client–Waiter games. Supervisor: Will Perkins.
• Amelia May Taylor (2017). Substructures in large graphs. Supervisor: Daniela Kühn.
• Michel Bode (2016). Random graphs on the hyperbolic plane. Supervisor: Nikolaos Fountoulakis.
• Timothy Duncan Townsend (2016). Extremal problems on graphs, directed graphs and hypergraphs. Supervisor: Daniela Kühn.
• Katherine Staden (2015). Robust expansion and hamiltonicity. Supervisor: Deryk Osthus.
• John Adam Lapinskas (2014). Packings and coverings with Hamilton cycles and on-line Ramsey theory. Supervisor: Daniela Kühn.
• Fiachra Knox (2013). Embedding spanning structures in graphs and hypergraphs. Supervisor: Deryk Osthus.
• Andrew Clark Treglown (2011). Embedding problems in graphs and hypergraphs. Supervisor: Daniela Kühn.
• Oliver Josef Nikolaus Cooley (2010). Embedding Problems for Graphs and Hypergraphs. Supervisor: Daniela Kühn.
• Luke Tristian Kelly (2010). On cycles in directed graphs. Supervisor: Deryk Osthus.
• Richard Mycroft (2010). The regularity method in directed graphs and hypergraphs. Supervisor: Deryk Osthus.