69 citations to 10.1137/090747476 (Crossref Cited-By Service)
  1. Victor Verdugo, José Verschae, 11480, Integer Programming and Combinatorial Optimization, 2019, 427  crossref
  2. Andrzej Grzesik, Daniel Král, László Miklós Lovász, “Elusive extremal graphs”, Proc. London Math. Soc., 121, no. 6, 2020, 1685  crossref
  3. Christian Reiher, Vojtĕch Rödl, Mathias Schacht, “On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs”, International Mathematics Research Notices, 2018, no. 16, 2018, 4899  crossref
  4. László A. Székely, Graph Theory, 2016, 211  crossref
  5. Matija Bucić, Jacob Cooper, Daniel Kráľ, Samuel Mohr, David Munhá Correia, “Uniform Turán density of cycles”, Trans. Amer. Math. Soc., 376, no. 7, 2023, 4765  crossref
  6. 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, no. 3, 2013, 384  crossref
  7. Noga Alon, Humberto Naves, Benny Sudakov, “On the Maximum Quartet Distance between Phylogenetic Trees”, SIAM J. Discrete Math., 30, no. 2, 2016, 718  crossref
  8. Peter Frankl, Jian Wang, “Four-vertex traces of finite sets”, Graphs and Combinatorics, 40, no. 1, 2024, 8  crossref
  9. József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao, “Turán Densities of Some Hypergraphs Related to $K_{k+1}^{k}$”, SIAM J. Discrete Math., 26, no. 4, 2012, 1609  crossref
  10. OLEG PIKHURKO, EMIL R. VAUGHAN, “Minimum Number ofk-Cliques in Graphs with Bounded Independence Number”, Combinator. Probab. Comp., 22, no. 6, 2013, 910  crossref
Previous
1
2
3
4
5
6
7
Next