Codruţ Grosu, “On the algebraic and topological structure of the set of Turán densities”, Journal of Combinatorial Theory, Series B, 118 (2016), 137
Noga Alon, Humberto Naves, Benny Sudakov, “On the Maximum Quartet Distance between Phylogenetic Trees”, SIAM J. Discrete Math., 30:2 (2016), 718
Noga Alon, Clara Shikhelman, “Many T copies in H-free graphs”, Journal of Combinatorial Theory, Series B, 121 (2016), 146
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, “Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle”, European Journal of Combinatorics, 52 (2016), 47
Noga Alon, Clara Shikhelman, “Many T copies in H -free graphs”, Electronic Notes in Discrete Mathematics, 49 (2015), 683
Roman Glebov, Andrzej Grzesik, Tereza Klimošová, Daniel Král', “Finitely forcible graphons and permutons”, Journal of Combinatorial Theory, Series B, 110 (2015), 112
JÓZSEF BALOGH, PING HU, BERNARD LIDICKÝ, OLEG PIKHURKO, BALÁZS UDVARI, JAN VOLEC, “Minimum Number of Monotone Subsequences of Length 4 in Permutations”, Combinator. Probab. Comp., 24:4 (2015), 658
Delia Garijo, Antonio González, Alberto Márquez, “The difference between the metric dimension and the determining number of a graph”, Applied Mathematics and Computation, 249 (2014), 487
James Hirst, “The Inducibility of Graphs on Four Vertices”, Journal of Graph Theory, 75:3 (2014), 231
Hamed Hatami, James Hirst, Serguei Norine, “The inducibility of blow-up graphs”, Journal of Combinatorial Theory, Series B, 109 (2014), 196