Karen Gunderson, Jason Semeraro, “Tournaments, 4-uniform hypergraphs, and an exact extremal result”, Journal of Combinatorial Theory, Series B, 126, 2017, 114
HAMED HATAMI, JAN HLADKÝ, DANIEL KRÁL', SERGUEI NORINE, ALEXANDER RAZBOROV, “Non-Three-Colourable Common Graphs Exist”, Combinator. Probab. Comp., 21, no. 5, 2012, 734
Roman Glebov, Tereza Klimošová, Daniel Král', “Infinite‐dimensional finitely forcible graphon”, Proc. London Math. Soc., 118, no. 4, 2019, 826
Jan Hladký, Daniel Král’, Sergey Norin, “Counting flags in triangle-free digraphs”, Combinatorica, 37, no. 1, 2017, 49
Zilong Yan, Yuejian Peng, “Lagrangian-Perfect Hypergraphs”, Ann. Comb., 27, no. 4, 2023, 957
PO-SHEN LOH, MICHAEL TAIT, CRAIG TIMMONS, RODRIGO M. ZHOU, “Induced Turán Numbers”, Combinator. Probab. Comp., 27, no. 2, 2018, 274
Grigoriy Blekherman, Annie Raymond, Mohit Singh, Rekha Thomas, “Tropicalization of graph profiles”, Trans. Amer. Math. Soc., 2022
Daniel Král’, Lukáš Mach, Jean-Sébastien Sereni, “A New Lower Bound Based on Gromov’s Method of Selecting Heavily Covered Points”, Discrete Comput Geom, 48, no. 2, 2012, 487
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
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