Bernard Lidický, Kyle Murphy, “Maximizing five-cycles in Kr-free graphs”, European Journal of Combinatorics, 97, 2021, 103367
József Balogh, Felix Christian Clemen, Bernard Lidický, “Maximum number of almost similar triangles in the plane”, Computational Geometry, 105-106, 2022, 101880
Andrzej Grzesik, Daniel Král', László Miklós Lovász, “Extremal graph theory and finite forcibility”, Electronic Notes in Discrete Mathematics, 61, 2017, 541
Jan Hladký, Ping Hu, Diana Piguet, “Tilings in graphons”, European Journal of Combinatorics, 93, 2021, 103284
HAMED HATAMI, JAN HLADKÝ, DANIEL KRÁL', SERGUEI NORINE, ALEXANDER RAZBOROV, “Non-Three-Colourable Common Graphs Exist”, Combinator. Probab. Comp., 21, № 5, 2012, 734
Peter Keevash, “A hypergraph regularity method for generalized Turán problems”, Random Struct Algorithms, 34, № 1, 2009, 123
RAHIL BABER, JOHN TALBOT, “Hypergraphs Do Jump”, Combinator. Probab. Comp., 20, № 2, 2011, 161
Pandelis Dodos, Konstantinos Tyros, Petros Valettas, “Concentration estimates for functions of finite high‐dimensional random arrays”, Random Struct Algorithms, 63, № 4, 2023, 997
Alexander Razborov, “An extremal problem motivated by triangle-free strongly regular graphs”, Journal of Combinatorial Theory, Series B, 155, 2022, 52
ALLAN LO, “Cliques in Graphs With Bounded Minimum Degree”, Combinator. Probab. Comp., 21, № 3, 2012, 457