Past Members of the group

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 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, probabilistic methods in graph theory, and graph limits. Moreover, I am interested in applying various techniques to the Erdős multiplication table problem.

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

My research interests lie in extremal and probabilistic combinatorics. In particular, I am interested in the study of extremal graph theory, random graphs, and the interface between these areas. Recently, I have also gained an interest in graph limits and beyond.

I am a Ph. D. student at FNSPE, CTU in Prague and my research topic there are the multidimensional continued fraction. This topic is strongly connected with combinatorics on words and number theory. I am also very interested in graph theory and I am now participating on a project which includes research about embedding trees in host graphs.

Mariia is getting training in graph theory. Due to the war in Ukraine, she relocated her studies to the Czech Republic.

My research focuses on extremal and probabilistic combinatorics. In particular, I am interested in the study of Ramsey Theory, random graphs, pseudo-random structures and tree embeddings. There has been a drift of my studies towards subjects with deeper probabilistic roots as I study different models of random graphs.

Tomas obtained his PhD from the University of Memphis under the supervision of Béla Bollobás. His interests include concentration of measure, small ball probability, and extremal combinatorics.

My research interests lie in the field of combinatorics and graph theory, mostly in extremal graph and hypergraph theory. I have studied Turán, Ramsey and embedding problems of tight cycles and paths in hypergraphs.

I have a wide range of research interests, mainly in the areas of extremal and probabilistic combinatorics. In particular, I am interested in extremal graph theory, graph colorings, graph decompositions, large networks, Ramsey theory, hypergraphs, clustering and community detection.

My main research areas area Computational Geometry and Graph Drawing, with an emphasis on proximity graphs and Voronoi diagrams, visibility and interval graphs. Recently I have also become interested in Extremal Graph Theory and I have started to work on problems involving graph tilings and graph limits.

My main area of research interest is Geometric Approximation Algorithms. As a researcher, I would like to contribute to the field of geometric algorithms and advance my future research towards the modeling of real-world problems through the perspective of computational geometry, and associated approximation algorithms.

My research interests lie broadly in Advanced Data Structures, Algorithms, Computational Geometry, Approximation Algorithms. Recently, I am working in Terrain Visibility problems and Problems with Imprecision, for the project titled "Structural properties of visibility in terrains and farthest color Voronoi diagrams".

My research interests include graph theory, classical combinatorics, Ramsey theory, and combinatorial geometry. In particular, I study Ramsey numbers of ordered graphs and hypergraphs and their connections to problems from discrete geometry such as Erdős-Szekeres-type problems.

My main research interests are extremal and probabilistic combinatorics. I have worked on problems involving moderate deviations on the count of arithmetic progressions in random sets and recently I have become interested in problems involving graph limits, graphons and inhomogeneous random graphs.

I am a PhD student at the Charles University, my supervisor is David Chodounsky. My interests lie in descriptive set theory and its application to other parts of mathematics such as borel equivalence relations, ergodic theory, borel combinatorics, forcing, graphons etc.

I work in combinatorics, probability and game theory. An example of a question I have been considering is the distribution of poison in an allocation game. My research interests include probabilistic and geometric analogues of this question.

My research is in the area of Spectral Graph Theory. I am interested in understanding how eigenvectors portray the structure of networks, such as community formation, connectivity, partitioning, etc.

I am an undergraduate student interested in extremal graph theory and graph limits. My current research includes using Szemeredi regularity lemma as a tool for proving certain asymptotic extremal results regarding embedding trees in a host graph.

Tereza is interested in a variety of problems in combinatorics. During her PhD she focused on using analytical tools for studying large discrete structures and algorithms for large inputs.

My research interests lie in combinatorics, particularly in probabilistic combinatorics, extremal combinatorics and positional games, as well as its applications to other areas of mathematics.