- V. Nikiforov, “The number of cliques in graphs of given order and size”, Trans. Amer. Math. Soc., 363, № 3, 2010, 1599
- Oleg Pikhurko, “ON possible Turán densities”, Isr. J. Math., 201, № 1, 2014, 415
- James Cummings, Daniel Králʼ, Florian Pfender, Konrad Sperfeld, Andrew Treglown, Michael Young, “Monochromatic triangles in three-coloured graphs”, Journal of Combinatorial Theory, Series B, 103, № 4, 2013, 489
- Roman Glebov, Tereza Klimošová, Daniel Král', “Infinite‐dimensional finitely forcible graphon”, Proc. London Math. Soc., 118, № 4, 2019, 826
- HONG LIU, OLEG PIKHURKO, KATHERINE STADEN, “THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE”, Forum of Mathematics, Pi, 8, 2020, e8
- Alexander A. Razborov, “On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs”, J. Graph Theory, 74, № 2, 2013, 236
- Victor Falgas‐Ravry, Oleg Pikhurko, Emil Vaughan, Jan Volec, “The codegree threshold of K4−$K_4^{-}$”, Journal of London Math Soc, 107, № 5, 2023, 1660
- Frederik Garbe, Daniel Král’, Ander Lamaison, “Hypergraphs with minimum positive uniform Turán density”, Isr. J. Math., 259, № 2, 2024, 701
- Annie Raymond, James Saunderson, Mohit Singh, Rekha R. Thomas, “Symmetric sums of squares over k-subset hypercubes”, Math. Program., 167, № 2, 2018, 315
- David Conlon, Jacob Fox, Benny Sudakov, Surveys in Combinatorics 2015, 2015, 49