Andrzej Grzesik, Daniel Král, László Miklós Lovász, “Elusive extremal graphs”, Proc. London Math. Soc., 121:6 (2020), 1685
Grigoriy Blekherman, Annie Raymond, Mohit Singh, Rekha R. Thomas, “Simple Graph Density Inequalities with No Sum of Squares Proofs”, Combinatorica, 40:4 (2020), 455
Shoham Letzter, “Many H-Copies in Graphs with a Forbidden Tree”, SIAM J. Discrete Math., 33:4 (2019), 2360
Noga Alon, Clara Shikhelman, “H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups”, Discrete Mathematics, 342:4 (2019), 988
Yazdan Bavafa-Toosi, Introduction to Linear Control Systems, 2019, 847
Oleg Pikhurko, Jakub Sliačan, Konstantinos Tyros, “Strong forms of stability from flag algebra calculations”, Journal of Combinatorial Theory, Series B, 135 (2019), 129
József Balogh, Bernard Lidický, Gelasio Salazar, “Closing in on Hill's Conjecture”, SIAM J. Discrete Math., 33:3 (2019), 1261
Miklós Simonovits, Endre Szemerédi, Bolyai Society Mathematical Studies, 28, Building Bridges II, 2019, 445
Roman Glebov, Tereza Klimošová, Daniel Král', “Infinite‐dimensional finitely forcible graphon”, Proc. London Math. Soc., 118:4 (2019), 826
Dániel Gerbner, Cory Palmer, “Counting copies of a fixed subgraph inF-free graphs”, European Journal of Combinatorics, 82 (2019), 103001