- Klas Markström, “Two Questions of Erdős on Hypergraphs above the Turán Threshold”, Journal of Graph Theory, 76, no. 2, 2014, 101
- Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov, “On the densities of cliques and independent sets in graphs”, Combinatorica, 36, no. 5, 2016, 493
- Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein, “Finding Cliques in Social Networks: A New Distribution-Free Model”, SIAM J. Comput., 49, no. 2, 2020, 448
- Jan Hladký, Ping Hu, Diana Piguet, “Tilings in graphons”, European Journal of Combinatorics, 93, 2021, 103284
- Raphael Yuster, “Edge-Disjoint Cliques in Graphs with High Minimum Degree”, SIAM J. Discrete Math., 28, no. 2, 2014, 893
- DÁNIEL T. NAGY, “On the Number of 4-Edge Paths in Graphs With Given Edge Density”, Combinator. Probab. Comp., 26, no. 3, 2017, 431
- Stijn Cambie, Rémi de Joannis de Verclos, Ross J. Kang, “Regular Turán numbers and some Gan–Loh–Sudakov‐type problems”, Journal of Graph Theory, 102, no. 1, 2023, 67
- Roman Glebov, Andrzej Grzesik, Tereza Klimošová, Daniel Král', “Finitely forcible graphons and permutons”, Journal of Combinatorial Theory, Series B, 110, 2015, 112
- Andrzej Grzesik, Daniel Král, László Miklós Lovász, “Elusive extremal graphs”, Proc. London Math. Soc., 121, no. 6, 2020, 1685
- Richard Kenyon, Charles Radin, Kui Ren, Lorenzo Sadun, “The phases of large networks with edge and triangle constraints”, J. Phys. A: Math. Theor., 50, no. 43, 2017, 435001