102 citations to 10.1017/S0963548308009085 (Crossref Cited-By Service)
  1. OLEG PIKHURKO, ALEXANDER RAZBOROV, “Asymptotic Structure of Graphs with the Minimum Number of Triangles”, Combinator. Probab. Comp., 26, no. 1, 2017, 138  crossref
  2. 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
  3. Jan Hladký, Daniel Král’, Sergey Norin, “Counting flags in triangle-free digraphs”, Combinatorica, 37, no. 1, 2017, 49  crossref
  4. Christian Reiher, “The clique density theorem”, Ann. Math., 184, no. 3, 2016, 683  crossref
  5. Hong Liu, Oleg Pikhurko, Maryam Sharifzadeh, “Edges not in any monochromatic copy of a fixed graph”, Journal of Combinatorial Theory, Series B, 135, 2019, 16  crossref
  6. Maria Dascălu, Annie Raymond, “Tropicalizing the Graph Profile of Some Almost-Stars”, SIAM J. Discrete Math., 38, no. 2, 2024, 1351  crossref
  7. Mikhail Gromov, “Singularities, Expanders and Topology of Maps. Part 2: from Combinatorics to Topology Via Algebraic Isoperimetry”, Geom. Funct. Anal., 20, no. 2, 2010, 416  crossref
  8. Richard Kenyon, Daniel Král', Charles Radin, Peter Winkler, “Permutations with fixed pattern densities”, Random Struct Algorithms, 56, no. 1, 2020, 220  crossref
  9. YUFEI ZHAO, “On the Lower Tail Variational Problem for Random Graphs”, Combinator. Probab. Comp., 26, no. 2, 2017, 301  crossref
  10. 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
Previous
1
2
3
4
5
6
7
11
Next