Christian Reiher, “The clique density theorem”, Ann. Math., 184, no. 3, 2016, 683
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young, “Rainbow triangles in three-colored graphs”, Journal of Combinatorial Theory, Series B, 126, 2017, 83
L. N. Coregliano, A. A. Razborov, “Semantic limits of dense combinatorial objects”, Russ. Math. Surv., 75, no. 4, 2020, 627
OLEG PIKHURKO, EMIL R. VAUGHAN, “Minimum Number ofk-Cliques in Graphs with Bounded Independence Number”, Combinator. Probab. Comp., 22, no. 6, 2013, 910
Stavros Garoufalidis, Sergey Norin, Thao Vuong, “Flag algebras and the stable coefficients of the Jones polynomial”, European Journal of Combinatorics, 51, 2016, 165
Andrzej Grzesik, Daniel Král, László Miklós Lovász, “Elusive extremal graphs”, Proc. London Math. Soc., 121, no. 6, 2020, 1685
Roman Glebov, Daniel Králʼ, Jan Volec, “An application of flag algebras to a problem of Erdős and Sós”, Electronic Notes in Discrete Mathematics, 43, 2013, 171
Ellen Gethner, Leslie Hogben, Bernard Lidický, Florian Pfender, Amanda Ruiz, Michael Young, “On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs”, Journal of Graph Theory, 84, no. 4, 2017, 552
Roman Glebov, Andrzej Grzesik, Tereza Klimošová, Daniel Král', “Finitely forcible graphons and permutons”, Journal of Combinatorial Theory, Series B, 110, 2015, 112
Johan Ugander, Lars Backstrom, Jon Kleinberg, Proceedings of the 22nd international conference on World Wide Web, 2013, 1307