Xiutao Zhu, Yaojun Chen, Dániel Gerbner, Ervin Győri, Hilal Hama Karim, “The maximum number of triangles in Fk-free graphs”, European Journal of Combinatorics, 114 (2023), 103793
Andrzej Grzesik, Ervin Győri, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora, “The maximum number of paths of length three in a planar graph”, Journal of Graph Theory, 101:3 (2022), 493
Xiutao Zhu, Yaojun Chen, “Generalized Turán number for linear forests”, Discrete Mathematics, 345:10 (2022), 112997
Dániel Gerbner, Cory Palmer, “Some exact results for generalized Turán problems”, European Journal of Combinatorics, 103 (2022), 103519
András Imolay, János Karl, Zoltán Lóránt Nagy, Benedek Váli, “Multicolor Turán numbers”, Discrete Mathematics, 345:9 (2022), 112976
А. А. Разборов, “Еще раз о разреженных вершинных полуграфах в графах без треугольников”, Матем. сб., 213:1 (2022), 119–140 ; A. A. Razborov, “More about sparse halves in triangle-free graphs”, Sb. Math., 213:1 (2022), 109–128
Andrzej Grzesik, Bartłomiej Kielak, “On the maximum number of odd cycles in graphs without smaller odd cycles”, Journal of Graph Theory, 99:2 (2022), 240
Grigoriy Blekherman, Annie Raymond, Mohit Singh, Rekha Thomas, “Tropicalization of graph profiles”, Trans. Amer. Math. Soc., 2022
Bernard Lidický, Florian Pfender, “Semidefinite Programming and Ramsey Numbers”, SIAM J. Discrete Math., 35:4 (2021), 2328
Dániel Gerbner, “On Turán-good graphs”, Discrete Mathematics, 344:8 (2021), 112445