- Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel, Tibor Szabó, “New Ramsey Multiplicity Bounds and Search Heuristics”, Found Comput Math, 2024

- Leonardo N. Coregliano, Maryanthe Malliaris, “Weak Randomness in Graphons and Theons”, Random Struct Algorithms, 2024, rsa.21261

- Gal Beniamini, Nir Lavee, Nati Linial, “How Balanced Can Permutations Be?”, Combinatorica, 45, № 1, 2025, 9

- FREDERIK GARBE, DANIEL KRÁL’, ALEXANDRU MALEKSHAHIAN, RAUL PENAGUIAO, “The dimension of the feasible region of pattern densities”, Math. Proc. Camb. Phil. Soc., 2025, 1

- József Balogh, Domagoj Bradač, Bernard Lidický, “Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems”, Journal of Graph Theory, 2025, jgt.23244

- Hao Chen, Yupeng Lin, Jie Ma, Fan Wei, “Undecidability of Polynomial Inequalities in Tournaments”, International Mathematics Research Notices, 2025, № 11, 2025, rnaf131

- Daniel Král’, Ander Lamaison, Magdalena Prorok, Xichao Shu, “The Dimension of the Region of Feasible Tournament Profiles”, SIAM J. Discrete Math., 39, № 2, 2025, 1335

- Natalie Behague, Natasha Morrison, Jonathan A. Noel, “Common pairs of graphs”, Combinator. Probab. Comp., 2025, 1

- Abdul Basit, Bertille Granet, Daniel Horsley, André Kündgen, Katherine Staden, 6, 2023 MATRIX Annals, 2025, 669

- Daniel Král͏̌, Jan Volec, Fan Wei, “Common graphs with arbitrary chromatic number”, Compositio Math., 161, № 3, 2025, 594
