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
Natasha Morrison, JD Nir, Sergey Norin, Paweł Rzążewski, Alexandra Wesolek, “Every graph is eventually Turán-good”, Journal of Combinatorial Theory, Series B, 162 (2023), 231
Maria Axenovich, Laurin Benz, David Offner, Casey Tompkins, “Generalized Turán densities in the hypercube”, Discrete Mathematics, 346:2 (2023), 113238
Xiutao Zhu, Yaojun Chen, Dániel Gerbner, Ervin Győri, Hilal Hama Karim, “The maximum number of triangles in Fk-free graphs”, European Journal of Combinatorics, 114 (2023), 103793
Andrzej Grzesik, Ervin Győri, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora, “The maximum number of paths of length three in a planar graph”, Journal of Graph Theory, 101:3 (2022), 493
Xiutao Zhu, Yaojun Chen, “Generalized Turán number for linear forests”, Discrete Mathematics, 345:10 (2022), 112997