I am an assistant professor in mathematics at Uppsala University.
Before coming to Uppsala, I held postdoctoral positions at LMU Munich (2019-2022) and the University of Oxford (2016-2019). I completed my DPhil in Oxford in 2017 under the supervision of Oliver Riordan.
Email: FIRSTNAME.LASTNAME@math.uu.se
I am interested in combinatorics and probability and the intersection between the two, including random graphs and other random discrete structures. Much of my past research has been about the chromatic number of random graphs.
Here is a guest post I wrote for Gil Kalai’s blog on my recent work showing non-concentration of the chromatic number.
Non-concentration of the chromatic number of a random graph, Journal of the American Mathematical Society 34, 245-260, 2021.
Random triangles in random graphs, Random Structures and Algorithms 59(4), 616-621, 2021.
Sharp concentration of the equitable chromatic number of dense random graphs, Combinatorics, Probability and Computing 29(2), 213-233, 2020.
The chromatic number of dense random graphs, Random Structures and Algorithms 53(1), 140-182, 2018.
On the threshold for rainbow connection number r in random graphs (with Oliver Riordan), Graphs and Combinatorics 32(1), 161-174, 2016.
Mathematical foundations of and empirical investigations into the dynamic of top positions: Stabilization Effect, Reversed Matthew Effect, and Heraclitus Effect (with Albert Ziegler and Albert Ziegler), Psychological Test and Assessment Modeling 55(4), 401-414, 2013.
The Hitting Time of Rainbow Connection Number Two (with Oliver Riordan), The Electronic Journal of Combinatorics 19(1), P37, 2012.
Cliques in the random graph process and the hitting time of clique factors (with Marc Kaufmann, Noela Müller, Matija Pasch), Oberwolfach Workshop 2217 “Combinatorics, Probability and Computing” 14-16, 2022.
Non-concentration of the chromatic number (with Oliver Riordan), Oberwolfach Workshop 2002 “Combinatorics” 30-33, 2020.
Non-concentration of χ(G(n,1/2)), Oberwolfach Workshop 1916 “Combinatorics, Probability and Computing”, 1141-1144, 2019.