11 citations to 10.1007/978-1-4614-7254-4_16 (Crossref Cited-By Service)
  1. 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  crossref
  2. 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, no. 4, 2015, 658  crossref
  3. József Balogh, Felix Christian Clemen, Bernard Lidický, “Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm”, Journal of London Math Soc, 106, no. 1, 2022, 60  crossref
  4. 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, no. 4, 2017, 552  crossref
  5. L. N. Coregliano, A. A. Razborov, “Semantic limits of dense combinatorial objects”, Russ. Math. Surv., 75, no. 4, 2020, 627  crossref
  6. Victor Falgas-Ravry, Klas Markström, Yi Zhao, “Triangle-degrees in graphs and tetrahedron coverings in 3-graphs”, Combinator. Probab. Comp., 30, no. 2, 2021, 175  crossref
  7. Andrzej Grzesik, Daniel Král, László Miklós Lovász, “Elusive extremal graphs”, Proc. London Math. Soc., 121, no. 6, 2020, 1685  crossref
  8. Johannes Carmesin, “Graph Theory – A Survey on the Occasion of the Abel Prize for László Lovász”, Jahresber. Dtsch. Math. Ver., 124, no. 2, 2022, 83  crossref
  9. Chaim Even-Zohar, Nati Linial, “A Note on the Inducibility of $4$ 4 -Vertex Graphs”, Graphs and Combinatorics, 31, no. 5, 2015, 1367  crossref
  10. Leonardo Nagami Coregliano, Alexander Alexandrovich Razborov, “Семантические пределы плотных комбинаторных объектов”, Успехи математических наук, 75, no. 4(454), 2020, 45  crossref
1
2
Next