Browse by Supervisor

Sangha, Pavan (2015). An introduction to the theory of random graphs. University of Birmingham. M.Res.

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.

Espuny Díaz, Alberto ORCID: https://orcid.org/0000-0001-5066-3820 (2020). Hamiltonicity problems in random graphs. University of Birmingham. Ph.D.

Naia dos Santos, Tassio ORCID: https://orcid.org/0000-0003-3158-4523 (2018). Large structures in dense directed graphs. University of Birmingham. Ph.D.

Coulson, Matthew (2020). Local approaches to global problems in extremal combinatorics. University of Birmingham. Ph.D.

Kelly, Luke Tristian (2010). On cycles in directed graphs. 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.

Granet, Bertille (2022). Path and cycle decompositions of graphs and digraphs. University of Birmingham. Ph.D.

Staden, Katherine (2015). Robust expansion and hamiltonicity. University of Birmingham. Ph.D.

Taylor, Amelia May (2017). Substructures in large graphs. University of Birmingham. Ph.D.

Mycroft, Richard (2010). The regularity method in directed graphs and hypergraphs. University of Birmingham. Ph.D.