- Daniel Král’, Oleg Pikhurko, “Quasirandom permutations are characterized by 4-point densities”, Geom. Funct. Anal., 23, № 2, 2013, 570
- Frederik Garbe, Daniel Král’, Ander Lamaison, 14, Extended Abstracts EuroComb 2021, 2021, 148
- Doudou Hei, Xinmin Hou, “The Cycle of Length Four is Strictly F-Turán-Good”, Bull. Malays. Math. Sci. Soc., 47, № 1, 2024, 5
- Roman Glebov, Daniel Král’, Jan Volec, “A problem of Erdős and Sós on 3-graphs”, Isr. J. Math., 211, № 1, 2016, 349
- Shunchang Huang, Lingsheng Shi, “Packing Triangles in K 4-Free Graphs”, Graphs and Combinatorics, 30, № 3, 2014, 627
- Victor Falgas-Ravry, Oleg Pikhurko, Emil Vaughan, Jan Volec, “The codegree threshold ofK4−”, Electronic Notes in Discrete Mathematics, 61, 2017, 407
- Tim Austin, “On exchangeable random variables and the statistics of large graphs and hypergraphs”, Probab. Surveys, 5, № none, 2008
- Louis Bellmann, Christian Reiher, “Turán’s Theorem for the Fano Plane”, Combinatorica, 39, № 5, 2019, 961
- Victor Verdugo, José Verschae, Andreas Wiese, “Breaking symmetries to rescue sum of squares in the case of makespan scheduling”, Math. Program., 183, № 1-2, 2020, 583
- Alexander A. Razborov, “On 3-Hypergraphs with Forbidden 4-Vertex Configurations”, SIAM J. Discrete Math., 24, № 3, 2010, 946