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.
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
Preprints
J. Hladky, E. K. Hng: Approximating fractionally isomorphic graphons [arXiv].
F. Garbe, J. Hladky, G. Kun, K. Pekarkova: On pattern-avoiding permutons [arXiv].
F. Garbe, J. Hladky, M. Sileikis, F. Skerman: From flip processes to dynamical systems on graphons [arXiv].
P. Araujo, J. Hladky, E. K. Hng, M. Sileikis: Prominent examples of flip processes [arXiv].
E. K. Hng, D. M. Cecchelli: Density of small diameter subgraphs in Kr-free graphs [arXiv].
Environmental and climate sustainability
Team members are encouraged to seek environmentally friendly ways of collaboration.
Practical
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.
