80 citations to https://www.mathnet.ru/eng/jcta1
-
Wojciech Samotij, Clara Shikhelman, “A generalized Turán problem in random graphs”, Random Struct Algorithms, 56:2 (2020), 283
-
Dániel Gerbner, Ervin Győri, Abhishek Methuku, Máté Vizer, “Generalized Turán problems for even cycles”, Journal of Combinatorial Theory, Series B, 145 (2020), 169
-
Ilkyoo Choi, Bernard Lidický, Florian Pfender, “Inducibility of directed paths”, Discrete Mathematics, 343:10 (2020), 112015
-
Andrzej Grzesik, Daniel Král, László Miklós Lová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 Sliačan, Konstantinos Tyros, “Strong forms of stability from flag algebra calculations”, Journal of Combinatorial Theory, Series B, 135 (2019), 129
-
József Balogh, Bernard Lidický, Gelasio Salazar, “Closing in on Hill's Conjecture”, SIAM J. Discrete Math., 33:3 (2019), 1261