Past Members of the group

Martin Balko
(Currently at Charles University)

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.

Jan Grebík
(Currently at The University of Warwick)

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.

Ramesh K. Jallu
(Currently at IIIT Raichur)

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.

Tereza Klimošová
(Currently at Charles University)

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. This area is closely related to extremal combinatorics, using many tools from it, most notably Szemeredi regularity lemma. She has also been working on problems related to minors and immersions of graphs.

Christos Pelekis
(Currently at National Technical University of Athens )

I work in combinatorics, probability and game theory. An example of a question I have been considering, which arose in the analysis of a particular allocation game, is the following: Suppose that you want to poison your mother-in-law. You know she is going to eat k biscuits from a tray that contains n biscuits in total, but you do not know which biscuit she is going to choose. Each biscuit has the same probability of being chosen. You possess h>1 grams of arsenic whose lethal dose is one gramme. How should you distribute the poison in order to maximize the probability that your mother-in-law gets the lethal dose? My research interests include probabilistic and geometric analogues of this question.

Israel Rocha
(Moved to industry)

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. Besides, I conduct research on extremal problems in Spectral Graph Theory, such as characterizing graphs that achieve extremal values of algebraic connectivity, energy, etc. Spectral techniques have been used for decades to successfully reveal the underlying properties of graphs. From graphs with a specific design to random graphs, and from finite to infinite graphs, I have been applying semidefinite optimization, probability theory, and matrix theory to expose such properties.

Václav Rozhoň
(currently at ETH Zurich)

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. Recently I got very interested in theory of graphons.

Tuan Tran
(currently at Hanoi University of Science and Technology)

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.
A typical question in extremal combinatorics asks how large a structure can be without containing a given substructure. For instance, a classic theorem in extremal set theory determines the size of the largest families of k-sets of {1,2,...,n} with the property that any two k-sets has non-empty intersection. I am particularly interested in applications of algebraic, analytic and probabilistic methods to this type of problems.