- Dhruv Mubayi, “Books Versus triangles”, Journal of Graph Theory, 70, no. 2, 2012, 171
- Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec, “On tripartite common graphs”, Combinator. Probab. Comp., 31, no. 5, 2022, 907
- Zoltán Füredi, Miklós Simonovits, 25, Erdős Centennial, 2013, 169
- Dhruv Mubayi, Alexander Razborov, “Polynomial to exponential transition in Ramsey theory”, Proc. London Math. Soc., 122, no. 1, 2021, 69
- Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko, “Minimizing the number of 5-cycles in graphs with given edge-density”, Combinator. Probab. Comp., 29, no. 1, 2020, 44
- Lucas Hosseini, Jaroslav Nešetřil, Patrice Ossona de Mendez, “Limits of mappings”, European Journal of Combinatorics, 66, 2017, 145
- Ehud Hrushovski, “Approximate equivalence relations”, Model Th., 3, no. 2, 2024, 317
- Johann A. Makowsky, “How I got to like graph polynomials”, Model Th., 3, no. 2, 2024, 465
- Leonardo N. Coregliano, “Left-Cut-Percolation and Induced-Sidorenko Bigraphs”, SIAM J. Discrete Math., 38, no. 2, 2024, 1586
- Roberto F. Parente, Cristiane M. Sato, Anais do II Encontro de Teoria da Computação (ETC 2017), 2017, 92