18 citations to https://www.mathnet.ru/rus/cpc1
-
HONG LIU, OLEG PIKHURKO, KATHERINE STADEN, “THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE”, Forum of Mathematics, Pi, 8 (2020)
-
Timothy F.N. Chan, Andrzej Grzesik, Daniel Král', Jonathan A. Noel, “Cycles of length three and four in tournaments”, Journal of Combinatorial Theory, Series A, 175 (2020), 105276
-
Roman Glebov, Tereza Klimošová, Daniel Král', “Infinite‐dimensional finitely forcible graphon”, Proc. London Math. Soc., 118:4 (2019), 826
-
Miklós Simonovits, Endre Szemerédi, Bolyai Society Mathematical Studies, 28, Building Bridges II, 2019, 445
-
Andrzej Grzesik, Ping Hu, Jan Volec, “Minimum number of edges that occur in odd cycles”, Journal of Combinatorial Theory, Series B, 137 (2019), 65
-
Hong Liu, Oleg Pikhurko, Katherine Staden, “The minimum number of triangles in graphs of given order and size”, Electronic Notes in Discrete Mathematics, 61 (2017), 805
-
Lingjiong Zhu, “Asymptotic Structure of Constrained Exponential Random Graph Models”, J Stat Phys, 166:6 (2017), 1464
-
Richard Kenyon, Charles Radin, Kui Ren, Lorenzo Sadun, “Bipodal Structure in Oversaturated Random Graphs”, Int Math Res Notices, 2016, rnw261