Samuel Braunfeld

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.

Jan Hladký

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 Kral. Jan's research focuses on extremal graph theory, random discrete structures, and graph limits. His most important projects include progress on the Loebl-Komlos-Sos Conjecture, Caccetta-Haggkvist Conjecture, and the Tree Packing Conjecture.

Vahideh Keikha

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.

Volodymyr Kuznietsov

Volodymyr is getting training in combinatorics. Due to the war in Ukraine, he chose to study in the Czech Republic.

Anna Limbach

My research interests are structural and probabilistic combinatorics. I like to work on problems regarding graph weightings and colourings, the dynamics of the clique graph operator, problabilistic methods in graph theory, and graph limits. Moreover, I am interested in applying various techniques to the Erdős multiplication table problem.

Diana Piguet

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 assymptotically solve a cojecture 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.

Matas Šileikis

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).