83 citations to https://www.mathnet.ru/rus/jcta1
  1. Chih-Ya Shen, Hong-Han Shuai, De-Nian Yang, Guang-Siang Lee, Liang-Hao Huang, Wang-Chien Lee, Ming-Syan Chen, “On Extracting Socially Tenuous Groups for Online Social Networks with k-Triangles”, IEEE Trans. Knowl. Data Eng., 2020, 1  crossref
  2. Lior Gishboliner, Asaf Shapira, “A Generalized Turán Problem and its Applications”, International Mathematics Research Notices, 2020:11 (2020), 3417  crossref
  3. Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko, “Minimizing the number of 5-cycles in graphs with given edge-density”, Combinator. Probab. Comp., 29:1 (2020), 44  crossref
  4. Wojciech Samotij, Clara Shikhelman, “A generalized Turán problem in random graphs”, Random Struct Algorithms, 56:2 (2020), 283  crossref
  5. Dániel Gerbner, Ervin Győri, Abhishek Methuku, Máté Vizer, “Generalized Turán problems for even cycles”, Journal of Combinatorial Theory, Series B, 145 (2020), 169  crossref
  6. Ilkyoo Choi, Bernard Lidický, Florian Pfender, “Inducibility of directed paths”, Discrete Mathematics, 343:10 (2020), 112015  crossref
  7. Andrzej Grzesik, Daniel Král, László Miklós Lovász, “Elusive extremal graphs”, Proc. London Math. Soc., 121:6 (2020), 1685  crossref
  8. 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
  9. Shoham Letzter, “Many H-Copies in Graphs with a Forbidden Tree”, SIAM J. Discrete Math., 33:4 (2019), 2360  crossref
  10. Noga Alon, Clara Shikhelman, “H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups”, Discrete Mathematics, 342:4 (2019), 988  crossref
Предыдущая
1
2
3
4
5
6
7
8
9
Следующая