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
Andrzej Grzesik, Ping Hu, Jan Volec, “Minimum number of edges that occur in odd cycles”, Journal of Combinatorial Theory, Series B, 137 (2019), 65
Ruth Luo, “The maximum number of cliques in graphs without long cycles”, Journal of Combinatorial Theory, Series B, 128 (2018), 219
Zoltán Füredi, Alexandr Kostochka, Ruth Luo, “Extensions of a theorem of Erdős on nonhamiltonian graphs”, Journal of Graph Theory, 89:2 (2018), 176
Lior Gishboliner, Asaf Shapira, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, 760
Dan Hefetz, Mykhaylo Tyomkyn, “On the inducibility of cycles”, Journal of Combinatorial Theory, Series B, 133 (2018), 243
Bernard Lidický, Florian Pfender, “Pentagons in triangle-free graphs”, European Journal of Combinatorics, 74 (2018), 85
PO-SHEN LOH, MICHAEL TAIT, CRAIG TIMMONS, RODRIGO M. ZHOU, “Induced Turán Numbers”, Combinator. Probab. Comp., 27:2 (2018), 274