Jacob Fox, Jonathan Tidor, Shengtong Zhang, “Triangle Ramsey numbers of complete graphs”, Journal of Combinatorial Theory, Series B, 176 (2026), 268
Zhipeng Gao, Ping Li, Changhong Lu, Rui Sun, Long-Tu Yuan, “The maximum number of cliques in graphs that avoid vertex-disjoint copies of path of length two”, Discrete Mathematics, 349:3 (2026), 114859
FREDERIK GARBE, DANIEL KRÁL', ALEXANDRU MALEKSHAHIAN, RAUL PENAGUIAO, “The dimension of the feasible region of pattern densities”, Math. Proc. Camb. Phil. Soc., 2025, 1
Ervin Győri, Zhen He, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu, “Exact Results for Generalized Extremal Problems Forbidding an Even Cycle”, Journal of Graph Theory, 2025
Daniel Král', Ander Lamaison, Magdalena Prorok, Xichao Shu, “The Dimension of the Region of Feasible Tournament Profiles”, SIAM J. Discrete Math., 39:2 (2025), 1335
Debsoumya Chakraborti, Da Qi Chen, “Exact results on generalized Erdős-Gallai problems”, European Journal of Combinatorics, 120 (2024), 103955
Dániel Gerbner, Balázs Patkós, “Generalized Turán results for intersecting cliques”, Discrete Mathematics, 347:1 (2024), 113710
Jianfeng Hou, Caihong Yang, Qinghou Zeng, “Counting triangles in graphs without vertex disjoint odd cycles”, Discrete Mathematics, 347:7 (2024), 114015
Fangfang Zhang, Yaojun Chen, Ervin Győri, Xiutao Zhu, “Maximum cliques in a graph without disjoint given subgraph”, Discrete Mathematics, 347:4 (2024), 113863
Benedek Kovács, Zoltán Lóránt Nagy, “Multicolor Turán numbers II: A generalization of the Ruzsa–Szemerédi theorem and new results on cliques and odd cycles”, Journal of Graph Theory, 2024