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
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
Bernard Lidický, Kyle Murphy, “Maximizing five-cycles in Kr-free graphs”, European Journal of Combinatorics, 97 (2021), 103367
Natasha Morrison, Alexander Roberts, Alex Scott, “Maximising the number of cycles in graphs with forbidden subgraphs”, Journal of Combinatorial Theory, Series B, 147 (2021), 201
Debarun Ghosh, Ervin Győri, Ryan R. Martin, Addisu Paulos, Nika Salia, Chuanqi Xiao, Oscar Zamora, “The maximum number of paths of length four in a planar graph”, Discrete Mathematics, 344:5 (2021), 112317