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