29 citations to https://www.mathnet.ru/eng/cpc2
  1. Daniel Král', Jonathan A. Noel, Sergey Norin, Jan Volec, Fan Wei, “Non-Bipartite K-Common Graphs”, Combinatorica, 42:1 (2022), 87  crossref
  2. Xihe Li, Hajo Broersma, Ligong Wang, “Extremal problems and results related to Gallai-colorings”, Discrete Mathematics, 344:11 (2021), 112567  crossref
  3. Andrzej Grzesik, Daniel Král, László Miklós Lovász, “Elusive extremal graphs”, Proc. London Math. Soc., 121:6 (2020), 1685  crossref
  4. Daniel Král', Taísa L. Martins, Péter Pál Pach, Marcin Wrochna, “The step Sidorenko property and non-norming edge-transitive graphs”, Journal of Combinatorial Theory, Series A, 162 (2019), 34  crossref
  5. DANIEL KRÁL', BERNARD LIDICKÝ, TAÍSA L. MARTINS, YANITSA PEHOVA, “Decomposing Graphs into Edges and Triangles”, Combinator. Probab. Comp., 28:3 (2019), 465  crossref
  6. Roman Glebov, Tereza Klimošová, Daniel Král', “Infinite‐dimensional finitely forcible graphon”, Proc. London Math. Soc., 118:4 (2019), 826  crossref
  7. 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
  8. Jacob W. Cooper, Daniel Král', Taísa L. Martins, “Finitely forcible graph limits are universal”, Advances in Mathematics, 340 (2018), 819  crossref
  9. L. N. Coregliano, A. A. Razborov, “On the density of transitive tournaments”, J. Graph Theory, 85:1 (2017), 12–21  mathnet  crossref  isi  scopus
  10. Ellen Gethner, Leslie Hogben, Bernard Lidický, Florian Pfender, Amanda Ruiz, Michael Young, “On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs”, Journal of Graph Theory, 84:4 (2017), 552  crossref
Previous
1
2
3
Next