![]() | Up a level |
Glock, Stefan (2018). Decompositions of graphs and hypergraphs. University of Birmingham. Ph.D.
Cooley, Oliver Josef Nikolaus (2010). Embedding Problems for Graphs and Hypergraphs. University of Birmingham. Ph.D.
Treglown, Andrew Clark (2011). Embedding problems in graphs and hypergraphs. University of Birmingham. Ph.D.
Knox, Fiachra (2013). Embedding spanning structures in graphs and hypergraphs. University of Birmingham. Ph.D.
Townsend, Timothy Duncan (2016). Extremal problems on graphs, directed graphs and hypergraphs. University of Birmingham. Ph.D.
Gould, Stephen (2023). Hamilton cycles in large graphs and hypergraphs: existence and counting. University of Birmingham. Ph.D.
Kelly, Luke Tristian (2010). On cycles in directed graphs. University of Birmingham. Ph.D.
Benford, Alistair (2023). On the appearance of oriented trees in tournaments. University of Birmingham. Ph.D.
Condon, Padraig (2020). Packing and embedding large subgraphs. University of Birmingham. Ph.D.
Lapinskas, John Adam (2014). Packings and coverings with Hamilton cycles and on-line Ramsey theory. University of Birmingham. Ph.D.
Mycroft, Richard (2010). The regularity method in directed graphs and hypergraphs. University of Birmingham. Ph.D.
Tan, Wei En (2017). Waiter–Client and Client–Waiter games. University of Birmingham. Ph.D.