152 citations to 10.2178/jsl/1203350785 (Crossref Cited-By Service)
  1. Christian Reiher, Vojtěch Rödl, Mathias Schacht, “Embedding tetrahedra into quasirandom hypergraphs”, Journal of Combinatorial Theory, Series B, 121, 2016, 229  crossref
  2. Bogdan Grechuk, Landscape of 21st Century Mathematics, 2021, 51  crossref
  3. Grigoriy Blekherman, Annie Raymond, Mohit Singh, Rekha R. Thomas, “Simple Graph Density Inequalities with No Sum of Squares Proofs”, Combinatorica, 40, № 4, 2020, 455  crossref
  4. Grigoriy Blekherman, Annie Raymond, Fan Wei, “Undecidability of polynomial inequalities in weighted graph homomorphism densities”, Forum of Mathematics, Sigma, 12, 2024, e40  crossref
  5. József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec, “The Spectrum of Triangle-Free Graphs”, SIAM J. Discrete Math., 37, № 2, 2023, 1173  crossref
  6. Andrzej Grzesik, “On the maximum number of five-cycles in a triangle-free graph”, Journal of Combinatorial Theory, Series B, 102, № 5, 2012, 1061  crossref
  7. Grigoriy Blekherman, Annie Raymond, Mohit Singh, Rekha Thomas, “Tropicalization of graph profiles”, Trans. Amer. Math. Soc., 2022  crossref
  8. Victor Verdugo, José Verschae, 11480, Integer Programming and Combinatorial Optimization, 2019, 427  crossref
  9. Jan Hladký, Daniel Král', Sergey Norin, “Counting flags in triangle-free digraphs”, Electronic Notes in Discrete Mathematics, 34, 2009, 621  crossref
  10. Swastik Kopparty, Benjamin Rossman, “The homomorphism domination exponent”, European Journal of Combinatorics, 32, № 7, 2011, 1097  crossref
Предыдущая
1
3
4
5
6
7
8
9
16
Следующая