29 citations to https://www.mathnet.ru/eng/cpc2
  1. Jang Soo Kim, Joonkyung Lee, “Extended commonality of paths and cycles via Schur convexity”, Journal of Combinatorial Theory, Series B, 166 (2024), 109  crossref
  2. Hao Chen, Jie Ma, “A Property on Monochromatic Copies of Graphs Containing a Triangle”, SIAM J. Discrete Math., 38:1 (2024), 316  crossref
  3. Natalie Behague, Natasha Morrison, Jonathan A. Noel, “Off-Diagonal Commonality of Graphs via Entropy”, SIAM J. Discrete Math., 38:3 (2024), 2335  crossref
  4. Nina Kamčev, Anita Liebenau, Natasha Morrison, “On uncommon systems of equations”, Isr. J. Math., 2024  crossref
  5. Endre Csóka, Tamás Hubai, László Lovász, “Locally common graphs”, Journal of Graph Theory, 102:3 (2023), 472  crossref
  6. David Conlon, Jacob Fox, Benny Sudakov, Fan Wei, “Threshold Ramsey multiplicity for paths and even cycles”, European Journal of Combinatorics, 107 (2023), 103612  crossref
  7. Robert Hancock, Daniel Král', Matjaž Krnc, Jan Volec, “Toward characterizing locally common graphs”, Random Struct Algorithms, 62:1 (2023), 181  crossref
  8. Sejin Ko, Joonkyung Lee, “Common graphs with arbitrary connectivity and chromatic number”, Journal of Combinatorial Theory, Series B, 162 (2023), 223  crossref
  9. A. A. Razborov, “More about sparse halves in triangle-free graphs”, Sb. Math., 213:1 (2022), 109–128  mathnet  mathnet  crossref  crossref  isi  scopus
  10. Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec, “On tripartite common graphs”, Combinator. Probab. Comp., 31:5 (2022), 907  crossref
1
2
3
Next