Mei Yin, Alessandro Rinaldo, Sukhada Fadnavis, “Asymptotic quantization of exponential random graphs”, Ann. Appl. Probab., 26, no. 6, 2016
Hamed Hatami, Jan Hladký, Daniel Králʼ, Serguei Norine, Alexander Razborov, “On the number of pentagons in triangle-free graphs”, Journal of Combinatorial Theory, Series A, 120, no. 3, 2013, 722
Oleg Pikhurko, “An analytic approach to stability”, Discrete Mathematics, 310, no. 21, 2010, 2951
Mihyun Kang, Tamás Makai, Oleg Pikhurko, “Supersaturation problem for the bowtie”, European Journal of Combinatorics, 88, 2020, 103107
V. Nikiforov, “The number of cliques in graphs of given order and size”, Trans. Amer. Math. Soc., 363, no. 3, 2010, 1599
Xizhi Liu, “Cancellative hypergraphs and Steiner triple systems”, Journal of Combinatorial Theory, Series B, 167, 2024, 303
Mihyun Kang, Tamás Makai, Oleg Pikhurko, “Supersaturation Problem for the Bowtie”, Electronic Notes in Discrete Mathematics, 61, 2017, 679
Shunchang Huang, Lingsheng Shi, “Packing Triangles in K 4-Free Graphs”, Graphs and Combinatorics, 30, no. 3, 2014, 627
Tim Austin, “On exchangeable random variables and the statistics of large graphs and hypergraphs”, Probab. Surveys, 5, no. none, 2008
Allan Lo, “Cliques in graphs with bounded minimum degree”, Electronic Notes in Discrete Mathematics, 34, 2009, 163