Gregory Gutin, Anders Yeo, “Lower Bounds for Maximum Weighted Cut”, SIAM J. Discrete Math., 37:2 (2023), 1142
Shunhai He, Huiqing Liu, “The maximum number of short paths in a Halin graph”, Discrete Optimization, 50 (2023), 100809
Natasha Morrison, JD Nir, Sergey Norin, Paweł Rzążewski, Alexandra Wesolek, “Every graph is eventually Turán-good”, Journal of Combinatorial Theory, Series B, 162 (2023), 231
Maria Axenovich, Laurin Benz, David Offner, Casey Tompkins, “Generalized Turán densities in the hypercube”, Discrete Mathematics, 346:2 (2023), 113238
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
A. A. Razborov, “More about sparse halves in triangle-free graphs”, Sb. Math., 213:1 (2022), 109–128