- Jacob W. Cooper, Daniel Král', Taísa L. Martins, “Finitely forcible graph limits are universal”, Advances in Mathematics, 340, 2018, 819
- David Conlon, Jacob Fox, Benny Sudakov, “Books versus Triangles at the Extremal Density”, SIAM J. Discrete Math., 34, no. 1, 2020, 385
- Nati Linial, Avraham Morgenstern, “On the Number of 4-Cycles in a Tournament”, J. Graph Theory, 83, no. 3, 2016, 266
- Ron Aharoni, Matthew DeVos, Ron Holzman, “Rainbow triangles and the Caccetta‐Häggkvist conjecture”, Journal of Graph Theory, 92, no. 4, 2019, 347
- Dániel Gerbner, Zoltán Lóránt Nagy, Máté Vizer, “Unified approach to the generalized Turán problem and supersaturation”, Discrete Mathematics, 345, no. 3, 2022, 112743
- Roman Glebov, Tereza Klimošová, Daniel Král', “Infinite‐dimensional finitely forcible graphon”, Proc. London Math. Soc., 118, no. 4, 2019, 826
- Alexander Razborov, “An Interview with Alexander Razborov”, Math Intelligencer, 44, no. 3, 2022, 193
- HONG LIU, OLEG PIKHURKO, KATHERINE STADEN, “THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE”, Forum of Mathematics, Pi, 8, 2020, e8
- Tomasz Łuczak, Joanna Polcyn, “Paths in Hypergraphs: A Rescaling Phenomenon”, SIAM J. Discrete Math., 33, no. 4, 2019, 2251
- Vojtěch Rödl, Andrzej Ruciński, Mathias Schacht, Endre Szemerédi, “On the Hamiltonicity of Triple Systems with High Minimum Degree”, Ann. Comb., 21, no. 1, 2017, 95