Project Graph limits and beyond


An "EXPRO project" funded by the Czech Science Foundation for the period January 2021-December 2025, the project "Graph limits and beyond" aims to advance understanding of limits of discrete structures (and dense and sparse graph limits in particular) and make connections to areas such as additive combinatorics and property testing. The project is hosted by the Institute of Computer Science of the Czech Academy of Sciences.

We have vivid collaboration with other researchers at the Institute, in particular with Diana Piguet and Matas Sileikis, and their students and postdocs. For the full list of members in these groups, see here.

Team members

Working with us

No further openings are planned within this project. If you are interested in working with us (including possible external funding schemes), please write us an email.

Please, contact Jan should you have any questions. Please, also contact him if you are considering joining the group using external funding, such as the Marie Sklodowska-Curie fellowship programme. Jan is committed to assist with ensuring fair working conditions that allow part times for those with family commitments, any questions in this direction are welcome.

Papers stemming from the project

Jan Hladký, Gopal Viswanathan: Random minimum spanning tree and dense graph limits

Eng Keat Hng: Characterization of flip process rules with the same trajectories

Jan Hladký, Gopal Viswanathan: Connectivity of inhomogeneous random graphs II

Frederik Garbe, Jan Hladký, Gábor Kun, Kristýna Pekárková: On pattern-avoiding permutons
accepted to Random Structures and Algorithms; [arXiv], [published]. [Here] is an identical copy of the published paper available as open access.

Frederik Garbe, Jan Hladký, Matas Šileikis, Fiona Skerman: From flip processes to dynamical systems on graphons
accepted to Annales de l'Institut Henri Poincaré (B) Probabilités et Statistiques; [arXiv].

Jan Hladký, Eng Keat Hng: Approximating fractionally isomorphic graphons
European Journal of Combinatorics, volume 113, 103751; [arXiv], [published]. [Extended abstract] appeared in the proceedings of Eurocomb 2023

Pedro Araújo, Jan Hladký, Eng Keat Hng, Matas Šileikis: Prominent examples of flip processes
accepted to Random Structures and Algorithms; [arXiv], [published]

Eng Keat Hng, Domenico Mergoni Cecchelli: Density of small diameter subgraphs in Kr-free graphs

Jan Hladký, Hanka Řada: Permutation flip processes
At this moment only as an [extended abstract] in the proceedings of Eurocomb 2023.

Environmental and climate sustainability

Team members are encouraged to seek environmentally friendly ways of collaboration.


The code of the grant according the Czech Science Foundation (GACR) is 21-21762X. The internal grant number of the Institute of Computer Science is 412.