75 citations to https://www.mathnet.ru/eng/jcta1
-
Zoltán Füredi, Alexandr Kostochka, Ruth Luo, “Extensions of a theorem of Erdő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 Lidický, 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 Turán Numbers”, Combinator. Probab. Comp., 27:2 (2018), 274
-
Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós, “On the Number of Cycles in a Graph with Restricted Cycle Lengths”, SIAM J. Discrete Math., 32:1 (2018), 266
-
Robert S. Coulter, Rex W. Matthews, Craig Timmons, “Planar polynomials and an extremal problem of Fischer and Matoušek”, Journal of Combinatorial Theory, Series B, 128 (2018), 96
-
Jacob W. Cooper, Daniel Král', Taísa L. Martins, “Finitely forcible graph limits are universal”, Advances in Mathematics, 340 (2018), 819
-
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young, “Rainbow triangles in three-colored graphs”, Journal of Combinatorial Theory, Series B, 126 (2017), 83
-
Oleg Pikhurko, Alexander Razborov, “Asymptotic structure of graphs with the minimum number of triangles”, Comb. Probab. Comput., 26:1 (2017), 138–160