77 citations to https://www.mathnet.ru/eng/jcta1
-
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
-
Zoltán Füredi, Lale Özkahya, “On 3-uniform hypergraphs without a cycle of a given length”, Discrete Applied Mathematics, 216 (2017), 582
-
Jan Hladký, Daniel Král', Sergey Norin, “Counting flags in triangle-free digraphs”, Combinatorica, 37:1 (2017), 49
-
Codruţ Grosu, “On the algebraic and topological structure of the set of Turá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
-
József Balogh, Ping Hu, Bernard Lidický, 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 Klimošová, Daniel Král', “Finitely forcible graphons and permutons”, Journal of Combinatorial Theory, Series B, 110 (2015), 112