P. L. Krapivsky, “Simple evolving random graphs”, Phys. Rev. E, 109:6 (2024)
Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel, Tibor Szabó, “New Ramsey Multiplicity Bounds and Search Heuristics”, Found Comput Math, 2024
Xizhi Liu, Oleg Pikhurko, “A note on extremal constructions for the Erdős–Rademacher problem”, Combinator. Probab. Comp., 2024, 1
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