Daniel Král', Taísa L. Martins, Péter Pál Pach, Marcin Wrochna, “The step Sidorenko property and non-norming edge-transitive graphs”, Journal of Combinatorial Theory, Series A, 162 (2019), 34
DANIEL KRÁL', BERNARD LIDICKÝ, TAÍSA L. MARTINS, YANITSA PEHOVA, “Decomposing Graphs into Edges and Triangles”, Combinator. Probab. Comp., 28:3 (2019), 465
Roman Glebov, Tereza Klimošová, Daniel Král', “Infinite‐dimensional finitely forcible graphon”, Proc. London Math. Soc., 118:4 (2019), 826
Andrzej Grzesik, Ping Hu, Jan Volec, “Minimum number of edges that occur in odd cycles”, Journal of Combinatorial Theory, Series B, 137 (2019), 65
Jacob W. Cooper, Daniel Král', Taísa L. Martins, “Finitely forcible graph limits are universal”, Advances in Mathematics, 340 (2018), 819
L. N. Coregliano, A. A. Razborov, “On the density of transitive tournaments”, J. Graph Theory, 85:1 (2017), 12–21
Ellen Gethner, Leslie Hogben, Bernard Lidický, Florian Pfender, Amanda Ruiz, Michael Young, “On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs”, Journal of Graph Theory, 84:4 (2017), 552
Jan Hladký, Daniel Král', Sergey Norin, “Counting flags in triangle-free digraphs”, Combinatorica, 37:1 (2017), 49
Codruţ Grosu, “On the algebraic and topological structure of the set of Turán densities”, Journal of Combinatorial Theory, Series B, 118 (2016), 137
Roman Glebov, Andrzej Grzesik, Tereza Klimošová, Daniel Král', “Finitely forcible graphons and permutons”, Journal of Combinatorial Theory, Series B, 110 (2015), 112