29 citations to https://www.mathnet.ru/eng/cpc2
  1. Jan Hladký, Daniel Král', Sergey Norin, “Counting flags in triangle-free digraphs”, Combinatorica, 37:1 (2017), 49  crossref
  2. Codruţ Grosu, “On the algebraic and topological structure of the set of Turán densities”, Journal of Combinatorial Theory, Series B, 118 (2016), 137  crossref
  3. Roman Glebov, Andrzej Grzesik, Tereza Klimošová, Daniel Král', “Finitely forcible graphons and permutons”, Journal of Combinatorial Theory, Series B, 110 (2015), 112  crossref
  4. JÓZSEF BALOGH, PING HU, BERNARD LIDICKÝ, OLEG PIKHURKO, BALÁZS UDVARI, JAN VOLEC, “Minimum Number of Monotone Subsequences of Length 4 in Permutations”, Combinator. Probab. Comp., 24:4 (2015), 658  crossref
  5. David Conlon, Jacob Fox, Benny Sudakov, Surveys in Combinatorics 2015, 2015, 49  crossref
  6. James Hirst, “The Inducibility of Graphs on Four Vertices”, Journal of Graph Theory, 75:3 (2014), 231  crossref
  7. Alexander A. Razborov, The Mathematics of Paul Erdős II, 2013, 207  crossref
  8. DANIEL KRÁL', CHUN-HUNG LIU, JEAN-SÉBASTIEN SERENI, PETER WHALEN, ZELEALEM B. YILMA, “A New Bound for the 2/3 Conjecture”, Combinator. Probab. Comp., 22:3 (2013), 384  crossref
  9. James Cummings, Daniel Králʼ, Florian Pfender, Konrad Sperfeld, Andrew Treglown, Michael Young, “Monochromatic triangles in three-coloured graphs”, Journal of Combinatorial Theory, Series B, 103:4 (2013), 489  crossref
Previous
1
2
3