Ervin Győri, Balázs Keszegh, “On the Number of Edge-Disjoint Triangles in K4-Free Graphs”, Combinatorica, 37, no. 6, 2017, 1113
Shagnik Das, Hao Huang, Jie Ma, Humberto Naves, Benny Sudakov, “A problem of Erdős on the minimum number of k -cliques”, Journal of Combinatorial Theory, Series B, 103, no. 3, 2013, 344
Jonathan Cutler, JD Nir, A. J. Radcliffe, “Supersaturation for Subgraph Counts”, Graphs and Combinatorics, 38, no. 3, 2022, 65
Miklós Simonovits, Endre Szemerédi, 28, Building Bridges II, 2019, 445
Teeradej Kittipassorn, Gábor Mészáros, “Frustrated triangles”, Discrete Mathematics, 338, no. 12, 2015, 2363
Xizhi Liu, Dhruv Mubayi, “The feasible region of hypergraphs”, Journal of Combinatorial Theory, Series B, 148, 2021, 23
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, “Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle”, European Journal of Combinatorics, 52, 2016, 47
PÉTER CSIKVÁRI, “Note on the Smallest Root of the Independence Polynomial”, Combinator. Probab. Comp., 22, no. 1, 2013, 1
Elvan Ceyhan, “Edge density of new graph types based on a random digraph family”, Statistical Methodology, 33, 2016, 31
Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov, “On the 3‐Local Profiles of Graphs”, Journal of Graph Theory, 76, no. 3, 2014, 236