103 citations to 10.1017/S0963548308009085 (Crossref Cited-By Service)
  1. Jacob W. Cooper, Daniel Král', Taísa L. Martins, “Finitely forcible graph limits are universal”, Advances in Mathematics, 340, 2018, 819  crossref
  2. David Conlon, Jacob Fox, Benny Sudakov, “Books versus Triangles at the Extremal Density”, SIAM J. Discrete Math., 34, no. 1, 2020, 385  crossref
  3. Nati Linial, Avraham Morgenstern, “On the Number of 4-Cycles in a Tournament”, J. Graph Theory, 83, no. 3, 2016, 266  crossref
  4. Ron Aharoni, Matthew DeVos, Ron Holzman, “Rainbow triangles and the Caccetta‐Häggkvist conjecture”, Journal of Graph Theory, 92, no. 4, 2019, 347  crossref
  5. Dániel Gerbner, Zoltán Lóránt Nagy, Máté Vizer, “Unified approach to the generalized Turán problem and supersaturation”, Discrete Mathematics, 345, no. 3, 2022, 112743  crossref
  6. Roman Glebov, Tereza Klimošová, Daniel Král', “Infinite‐dimensional finitely forcible graphon”, Proc. London Math. Soc., 118, no. 4, 2019, 826  crossref
  7. Alexander Razborov, “An Interview with Alexander Razborov”, Math Intelligencer, 44, no. 3, 2022, 193  crossref
  8. 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, e8  crossref
  9. Tomasz Łuczak, Joanna Polcyn, “Paths in Hypergraphs: A Rescaling Phenomenon”, SIAM J. Discrete Math., 33, no. 4, 2019, 2251  crossref
  10. Vojtěch Rödl, Andrzej Ruciński, Mathias Schacht, Endre Szemerédi, “On the Hamiltonicity of Triple Systems with High Minimum Degree”, Ann. Comb., 21, no. 1, 2017, 95  crossref
Previous
1
2
3
4
5
11
Next