17 citations to https://www.mathnet.ru/eng/cpc1
  1. 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  crossref
  2. Roman Glebov, Tereza Klimošová, Daniel Král', “Infinite‐dimensional finitely forcible graphon”, Proc. London Math. Soc., 118:4 (2019), 826  crossref
  3. Miklós Simonovits, Endre Szemerédi, Bolyai Society Mathematical Studies, 28, Building Bridges II, 2019, 445  crossref
  4. Andrzej Grzesik, Ping Hu, Jan Volec, “Minimum number of edges that occur in odd cycles”, Journal of Combinatorial Theory, Series B, 137 (2019), 65  crossref
  5. 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  crossref
  6. Lingjiong Zhu, “Asymptotic Structure of Constrained Exponential Random Graph Models”, J Stat Phys, 166:6 (2017), 1464  crossref
  7. Richard Kenyon, Charles Radin, Kui Ren, Lorenzo Sadun, “Bipodal Structure in Oversaturated Random Graphs”, Int Math Res Notices, 2016, rnw261  crossref
Previous
1
2