Dr Joshua Erde BA MA MMath PhD

Joshua Erde

School of Mathematics
Assistant Professor in Combinatorics

Contact details

Address
Watson Building
University of Birmingham
Edgbaston
Birmingham
B15 2TT
UK
Joshua Erde is an Assistant Professor at the School of Mathematics and a member of the Combinatorics Research Group

Joshua’s research interests lie in the intersection of combinatorics, probability and discrete geometry, with an emphasis on discrete random structures.

Personal webpage.

Qualifications

  • Habilitation, Graz University of Technology (2021)
  • Habilitation, University of Hamburg (2020)
  • PhD in Mathematics, University of Cambridge (2014)
  • MMath, University of Cambridge (2010)
  • MA (Cantab) in Mathematics, University of Cambridge (2009)

Biography

Joshua studied for his BA/MMath and PhD at the University of Cambridge from 2006-2014. From 2014 to 2019 he was a postdoctoral researcher at the University of Hamburg, supported for two years as a fellow of the Alexander von Humboldt research institute. From 2019 to 2025, he was a non-tenured Assistant Professor at Graz University of Technology. Since August 2025, he has been an Assistant Professor in the School of Mathematics at the University of Birmingham.

Teaching

Semester 2

  • LH/LM Communications Theory

Postgraduate supervision

Joshua is interested in supervising PhD students in Combinatorics. Please get in touch via email.

Research

Research Themes

  • Probabilistic combinatorics
  • High-dimensional random structures and processes
  • Structural graph theory
  • Infinitary combinatorics
  • Combinatorial games

Research activity

Joshua is interested in random graph models and random processes on graphs, in particular those where the underlying model has some sparse rigid geometric or algebraic structure.

For example, much is known about the evolution of the structure of the classic binomial random graph model. Much less is known when for broader classes of random subgraphs, although results suggest that the behaviour of the binomial random graphs is `universal’ when the host graph is sufficiently ‘well-structured’.

Joshua’s recent results in this area include bounding parameters such as the diameter or circumference of random subgraphs of graphs with a high-dimensional product structure, such as the hypercube.

Publications

Recent publications

Article

Erde, J, Kang, M, Lehner, F, Mohar, B & Schmid, D 2025, 'Catching a robber on a random k-uniform hypergraph', Canadian Journal of Mathematics, vol. 77, no. 4, pp. 1135-1162. https://doi.org/10.4153/S0008414X24000270

Collares, M, Erde, J, Diskin, S & Krivelevich, M 2025, 'Long cycles in percolated expanders', Electronic Journal of Combinatorics, vol. 32, no. 1, P1.8. https://doi.org/10.37236/13219

Diskin, S, Erde, J, Kang, M & Krivelevich, M 2025, 'Percolation on High-Dimensional Product Graphs', Random Structures and Algorithms, vol. 66, no. 1, e21268. https://doi.org/10.1002/rsa.21268

Cooley, O, Do, TA, Erde, J & Missethan, M 2025, 'The emergence of a giant rainbow component', European Journal of Combinatorics, vol. 127, 104154. https://doi.org/10.1016/j.ejc.2025.104154

Do, TA, Erde, J & Kang, M 2024, 'A note on the width of sparse random graphs', Journal of Graph Theory, vol. 106, no. 2, pp. 273-295. https://doi.org/10.1002/jgt.23081

Diestel, R, Elbracht, C, Erde, J & Teegen, M 2024, 'Duality and tangles of set separations', Journal of Combinatorics, vol. 15, no. 1, pp. 1-39. https://doi.org/10.4310/JOC.2024.v15.n1.a1

Diskin, S, Erde, J, Kang, M & Krivelevich, M 2024, 'Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs', Combinatorica, vol. 44, no. 4, pp. 741-784. https://doi.org/10.1007/s00493-024-00089-0

Preprint

Anastos, M, Erde, J, Kang, M & Pfenninger, V 2025 'A short proof of a central limit theorem for the order of the giant component and k-core' arXiv. https://doi.org/10.48550/arXiv.2506.11651

Collares, M, Erde, J, Geisler, A & Kang, M 2025 'Counting independent sets in expanding bipartite regular graphs' arXiv. https://doi.org/10.48550/arXiv.2503.22255

Anastos, M, Diskin, S, Erde, J, Kang, M, Krivelevich, M & Lichev, L 2025 'Cycle lengths in the percolated hypercube' arXiv. https://doi.org/10.48550/arXiv.2506.16858

Collares, M, Erde, J, Geisler, A & Kang, M 2025 'Majority bootstrap percolation on the permutahedron and other high-dimensional graphs' arXiv. https://doi.org/10.48550/arXiv.2507.06597

Anastos, M, Diskin, S, Erde, J, Kang, M, Krivelevich, M & Lichev, L 2025 'Nearly spanning cycle in the percolated hypercube' arXiv. https://doi.org/10.48550/arXiv.2505.04436

Anastos, M, Collares, M, Erde, J, Kang, M, Schmid, D & Sorkin, GB 2025 'Optimally building spanning graphs in semirandom graph processes' arXiv, pp. 1-22. https://doi.org/10.48550/arXiv.2509.26028

Anastos, M, Erde, J, Kang, M & Pfenninger, V 2025 'The law of the circumference of sparse binomial random graphs' arXiv. https://doi.org/10.48550/arXiv.2503.14336

Diskin, S, Erde, J, Kang, M & Krivelevich, M 2024 'Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs' arXiv. https://doi.org/10.48550/arXiv.2407.16458

View all publications in research portal