I am currently a postdoctoral researcher in the Combinatorial group at the Institute of Computer Science of the Czech Academy of Sciences, working with Jan Hladký on the Czech Science Foundation (GAČR) EXPRO Project "Graph limits and beyond". Previously, I was a PhD student at the Department of Mathematics of the London School of Economics and Political Science under the supervision of Julia Böttcher and Peter Allen.

My research interests include extremal and probabilistic combinatorics. I have worked on problems in extremal graph theory and random graphs.

Contact

Ústav informatiky AV ČR, v.v.i.
Pod Vodárenskou věží 271/2
182 00 Praha 8
Czech Republic

Publications

A sparse hypergraph blow-up lemma, with Peter Allen, Julia Böttcher, Ewan Davies, and Jozef Skokan. An earlier version is available as Chapter 4 of my PhD thesis.

Characterization of flip process rules with the same trajectories, arXiv:2305.19925

Prominent examples of flip processes, with Pedro Campos Araújo, Jan Hladký, and Matas Šileikis, Random Structures & Algorithms (2023). DOI, arXiv
Approximating fractionally isomorphic graphons, with Jan Hladký, European Journal of Combinatorics 113 (2023), 103751. DOI, arXiv
Minimum degrees for powers of paths and cycles, SIAM Journal on Discrete Mathematics 36 (2022), no 4, 2667-2736. DOI, arXiv
Longest paths in random hypergraphs, with Oliver Cooley, Frederik Garbe, Mihyun Kang, Nicolás Sanhueza-Matamala, and Julian Zalla, SIAM Journal on Discrete Mathematics 35 (2021), no 4, 2430-2458. DOI, arXiv
Completing graphs to metric spaces, with Andrés Aranda, David Bradley-Williams, Jan Hubička, Miltiadis Karamanlis, Michael Kompatscher, Matěj Konečný, and Micheal Pawliuk, Contributions to Discrete Mathematics 16 (2021), no 2, 71-89. DOI, arXiv

Fractionally isomorphic graphs and graphons, with Jan Hladký. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2023). DOI
An approximate blow-up lemma for sparse hypergraphs, with Peter Allen, Julia Böttcher, Ewan Davies, and Jozef Skokan, Procedia Computer Science 195 (2021), 395-403. Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2021). DOI
Minimum degree conditions for powers of cycles and paths, Acta Mathematica Universitatis Comenianae 88 (2019), no 3, 795–800. Proceedings of the 10th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2019). URL