P. L. Krapivsky, “Simple evolving random graphs”, Phys. Rev. E, 109:6 (2024)
Joe Neeman, Charles Radin, Lorenzo Sadun, “Typical large graphs with given edge and triangle densities”, Probab. Theory Relat. Fields, 186:3-4 (2023), 1167
Alexander Razborov, “An Interview with Alexander Razborov”, Math Intelligencer, 44:3 (2022), 193
Victor Falgas-Ravry, Klas Markström, Yi Zhao, “Triangle-degrees in graphs and tetrahedron coverings in 3-graphs”, Combinator. Probab. Comp., 30:2 (2021), 175
Bogdan Grechuk, Landscape of 21st Century Mathematics, 2021, 51
Cristian Giardinà, Claudio Giberti, Elena Magnanini, “Approximating the Cumulant Generating Function of Triangles in the Erdös–Rényi Random Graph”, J Stat Phys, 182:2 (2021)
Andrzej Grzesik, Daniel Král, László Miklós Lovász, “Elusive extremal graphs”, Proc. London Math. Soc., 121:6 (2020), 1685
Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko, “Minimizing the number of 5-cycles in graphs with given edge-density”, Combinator. Probab. Comp., 29:1 (2020), 44
HONG LIU, OLEG PIKHURKO, KATHERINE STADEN, “THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE”, Forum of Mathematics, Pi, 8 (2020)
Timothy F.N. Chan, Andrzej Grzesik, Daniel Král', Jonathan A. Noel, “Cycles of length three and four in tournaments”, Journal of Combinatorial Theory, Series A, 175 (2020), 105276