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
Ervin Győri, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora, Trends in Mathematics, 14, Extended Abstracts EuroComb 2021, 2021, 262
Anastasia Halfpap, Cory Palmer, “On supersaturation and stability for generalized Turán problems”, Journal of Graph Theory, 97:2 (2021), 232
Bo Ning, Xing Peng, “Extensions of the Erdős–Gallai theorem and Luo's theorem”, Combinator. Probab. Comp., 29:1 (2020), 128
Jie Ma, Yu Qiu, “Some sharp results on the generalized Turán numbers”, European Journal of Combinatorics, 84 (2020), 103026