My interests are in the interactions of model theory and finite combinatorics. In particular, this includes understanding what the model-theoretic concepts of stability and NIP yield in hereditary classes, leading to interactions with sparsity theory/structural graph theory. More recently, this also includes interactions with exchangeability.

Frederik received his PhD in 2018 from the University of Birmingham, supervised by Richard Mycroft. He has since held positions at the Institute of Mathematics of the Czech Academy of Sciences, Masaryk University, and Heidelberg University. His research interests include extremal problems in graphs and hypergraphs and limit theories of discrete structures.

Jan obtained his PhD from the University of Warwick in 2011 under the supervision of Artur Czumaj and from Charles University in 2013 under the supervision of Dan Král. Jan's research focuses on extremal graph theory, random discrete structures, and graph limits.

My main research area is in Computational Geometry. I am particularly interested in problems involving data uncertainty, approximation algorithms, data structures, and random algorithms. I have joined the project "Structural properties of visibility in terrains and farthest color Voronoi diagrams" and, I have also become interested in graph drawing and many related problems.

Simón obtained his PhD in 2022 at the University of Hamburg under the supervision of Mathias Schacht, after which he held a postdoctoral position at the University of Birmingham. His research interests lie in extremal and probabilistic combinatorics, especially in problems for hypergraphs and finite sets.

Diana's research interests lie in extremal graph theory, Ramsey theory, probabilistic method, and limits of graphs. In particular together with Komlós, Hladký, Simonovits, Stein, and Szemerédi, she used a generalisation of the regularity lemma to sparse graphs to asymptotically solve a conjecture of Loebl, Komlós and Sós on trees. Together with Böttcher, Hladký and Taraz, she used the Rödl nibble method to make significant progress on a conjecture of Gyárfás about packing trees.

My main interests are random discrete structures and tail probability inequalities. I have contributed to progress on the Kim-Vu Sandwich Conjecture (and its extension to random hypergraphs) and the Upper Tail Problem for subgraph counts in the random graph G(n,p). Moreover, I am interested in random graphs in the context of the dense graph limits (graphons).

Rob obtained his PhD in 2022 at Imperial College London under the supervision of David Evans, after which he held a postdoctoral position at the University of Münster. He currently works in Ramsey theory and model theory of ultrahomogeneous structures.