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
John Goldwasser, Ryan Hansen, “Maximum density of vertex-induced perfect cycles and paths in the hypercube”, Discrete Mathematics, 344:11 (2021), 112585
Dhruv Mubayi, Alexander Razborov, “Polynomial to exponential transition in Ramsey theory”, Proc. London Math. Soc. (3), 122:1 (2021), 69–92
Xiutao Zhu, Fangfang Zhang, Yaojun Chen, “Generalized Turán Number of Even Linear Forests”, Graphs and Combinatorics, 37:4 (2021), 1437