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
James Tuite, Grahame Erskine, Nika Salia, “Turán Problems for k-Geodetic Digraphs”, Graphs and Combinatorics, 39:2 (2023)
J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins, Xin Zhang, “Counting cliques in 1-planar graphs”, European Journal of Combinatorics, 109 (2023), 103654
Xiutao Zhu, Ervin Győri, Zhen He, Zequn Lv, Nika Salia, Chuanqi Xiao, “Stability version of Dirac's theorem and its applications for generalized Turán problems”, Bulletin of London Math Soc, 55:4 (2023), 1857
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