We have a vivid collaboration with the Extremal graph theory group at the Institute of Computer Science of the Czech Academy of Sciences.

- Martin Dolezal (since January 2018)
- Frederik Garbe (since April 2018)
- Robert Hancock (July-December 2018)
- Jan Hladky (principal investigator, from August 2018)
- Tomas Juskevicius (since October 2020)
- Christos Pelekis (January 2018-December 2019)

- Ch. Pelekis: On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs

Le Matematiche 74 (1), 2019, pp. 119-130; [published]; [arXiv] - K. Engel, Th. Mitsis, Ch. Pelekis, Ch. Reiher: Projection inequalities for antichains

Israel Journal of Mathematics volume 238, pages 61-90(2020); [published]; [arXiv] - M. Dolezal, Th. Mitsis, Ch. Pelekis: The de Bruijn-Erdos theorem from a Hausdorff measure point of view

Acta Mathematica Hungarica 159 (2), 2019, pp. 400-413; [published]; [arXiv] - Th. Mitsis, Chr. Pelekis, V. Vlasak: A continuous analogue of Erdos' k-Sperner theorem

Journal of Mathematical Analysis and Applications, Volume 484, Issue 2 (2020), 123754; [published], [arXiv] - C. Pelekis, V. Vlasak: On k-antichains in the unit n-cube

Publicationes Mathematica Debrecen, Volume 96, Issue 3-4 (2020), 15; [published]; [arXiv] - M. Dolezal, J. Hladky, J. Kolar, T. Mitsis, C. Pelekis, V. Vlasak: A Turan-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems

accepted to Discrete & Computational Geometry; [published]; [arXiv]. [Here] is an identical copy of the published paper available as open access. [Extended abstract] appeared in the proceedings of Eurocomb 2019 [here] - M. Dolezal, J. Grebik, J. Hladky, I. Rocha, V. Rozhon: Relating the cut distance and the weak* topology for graphons

accepted to Journal of Combinatorial Theory, series B; [published]; [arXiv] - F. Garbe, J. Hladky, J. Lee: Two remarks on graph norms

accepted to Discrete & Computational Geometry, [arXiv]

- F. Garbe, R. Hancock, J. Hladky, M. Sharifzadeh: Limits of Latin squares

[arXiv]; extended abstract "Theory of limits of sequences of Latin squares" appeared in proceedings of Eurocomb 2019 [here] - M. Dolezal: Graph limits: An alternative approach to s-graphons

[arXiv] - O. Cooley, F. Garbe, E. K. Hng, M. Kang, N. Sanhueza-Matamala, J. Zalla: Longest paths in random hypergraphs

[arXiv] - R. Fokkink, L. Meester, C. Pelekis: Optimizing stakes in simultaneous bets

[arXiv] - M. Dolezal, J. Grebik, J. Hladky, I. Rocha, V. Rozhon: Cut distance identifying graphon parameters over weak* limits

[arXiv] - J. Hladky, Ch. Pelekis, M. Sileikis: A limit theorem for small cliques in inhomogeneous random graphs

[arXiv]

The Institute of Mathematics has postdocs openings (typically with deadlines in March and September) within the "Academic Human Resource Programme" advertised. We would be happy to answer any questions a potantial candidate might have. Please, also contact us if you are considering joining the group using external funding, such as the Marie Sklodowska-Curie fellowship programme.