Vladimir Remeslennikov, “Limit combinatorics as a method for investigating of mathematical models”, J. Phys.: Conf. Ser., 1050 (2018), 012068
L. N. Coregliano, A. A. Razborov, “On the density of transitive tournaments”, J. Graph Theory, 85:1 (2017), 12–21
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young, “Rainbow triangles in three-colored graphs”, Journal of Combinatorial Theory, Series B, 126 (2017), 83
Jan Hladký, Daniel Král', Sergey Norin, “Counting flags in triangle-free digraphs”, Combinatorica, 37:1 (2017), 49
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
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
Sergey Norin, Liana Yepremyan, “Sparse halves in dense triangle-free graphs”, Journal of Combinatorial Theory, Series B, 115 (2015), 1
Nicolas Lichiardopol, “Proof of the Caccetta–Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two”, Discrete Mathematics, 313:14 (2013), 1540
Patrick St-Louis, Bernard Gendron, Alain Hertz, “Total domination and the Caccetta–Häggkvist conjecture”, Discrete Optimization, 9:4 (2012), 236