D. Cherkashin, S. Kiselev, “Independence Numbers of Johnson-Type Graphs”, Bulletin of the Brazilian Mathematical Society, New Series, 54:3 (2023), 30
D. Cherkashin, Y. Teplitskaya, “A Self-Similar Infinite Binary Tree Is a Solution to the Steiner Problem”, Fractal and Fractional, 7:5 (2023), 414
A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 89–146
D. Cherkashin, F. Petrov,, “Regular behavior of the maximal hypergraph chromatic number”, SIAM Journal on Discrete Mathematics, 34:2 (2020), 1326–1333
D. Cherkashin, Y. Teplitskaya, “On the horseshoe conjecture for maximal distance minimizers”, ESAIM: Control, Optimisation and Calculus of Variations, 24:3 (2018), 1015–1041
D. D. Cherkashin, J. Kozik, “A note on random greedy coloring of uniform hypergraphs”, Random Structures & Algorithms, 47:3 (2015), 407–413
M. Basok, D. Cherkashin, N. Rastegaev, Y. Teplitskaya, “On uniqueness in Steiner problem”, International Mathematics Research Notices, 10 (2024), 8819–8838
4.
Cherkashin, D., Gordeev, A. & Strukov, G., “Erdős–Hajnal Problem for $H$-Free Hypergraphs”, Graphs and Combinatorics, 40 (2024), ¹10
2023
5.
D. Cherkashin, F. Petrov, P. Prozorov, “On stability of spanning tree degree enumerators”, Discrete Mathematics, 346:12 (2023), 113629
6.
D. Cherkashin, S. Kiselev, “Independence Numbers of Johnson-Type Graphs”, Bulletin of the Brazilian Mathematical Society, New Series, 54:3 (2023), 30
7.
D. Cherkashin, Y. Teplitskaya, “A Self-Similar Infinite Binary Tree Is a Solution to the Steiner Problem”, Fractal and Fractional, 7:5 (2023), 414
D. Cherkashin, “On small non-uniform hypergraphs without property B”, MATHEMATICS AND EDUCATION IN MATHEMATICS, Proceedings of the Fifty Second Spring Conference of the Union of Bulgarian Mathematicians (Borovets, April 10–14, 2023), Union of Bulgarian Mathematicians, 2023, 71–75
2022
9.
D. D. Cherkashin, “On the chromatic numbers of Johnson-type graphs”, Combinatorics and graph theory. Part XIII, Zap. Nauchn. Sem. POMI, 518, POMI, St. Petersburg, 2022, 192–200
10.
V. A. Voronov, A. Ya. Kanel-Belov, G. A. Strukov, D. D. Cherkashin, “On the chromatic numbers of $3$-dimensional slices”, Combinatorics and graph theory. Part XIII, Zap. Nauchn. Sem. POMI, 518, POMI, St. Petersburg, 2022, 94–113
11.
M. Antipov, D. Cherkashin, “Lovász theta approach to eventown problem”, Linear Algebra and its Applications, 655 (2022), 302–313
D. Cherkashin, P. Prozorov, “On the minimal sum of edges in a signed edge-dominated graph”, The Electronic Journal of Combinatorics, 29:3 (2022), P3.38
13.
Cherkashin D. D., Gordeev A. S, “On list chromatic numbers of 2-colorable hypergraphs”, Trudy MFTI, 14:1 (53) (2022), 49–57
2020
14.
A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 89–146
15.
D. Cherkashin, F. Petrov,, “Regular behavior of the maximal hypergraph chromatic number”, SIAM Journal on Discrete Mathematics, 34:2 (2020), 1326–1333
D. .D. Cherkashin, “On the Erdös–Hajnal problem for 3-graphs”, Journal of Mathematical Sciences, 255 (2021), 103–108
2019
17.
J. Balogh, D. Cherkashin, S. Kiselev, “Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs”, European Journal of Combinatorics, 79 (2019), 228–236
D. Cherkashin, A. Kulikov, A. Raigorodskii, “On the chromatic numbers of small-dimensional Euclidean spaces”, Discrete Applied Mathematics, 243 (2018), 125–131
D. Cherkashin, Y. Teplitskaya, “On the horseshoe conjecture for maximal distance minimizers”, ESAIM: Control, Optimisation and Calculus of Variations, 24:3 (2018), 1015–1041
23.
A. Ya. Kanel-Belov, V. A. Voronov, D. D. Cherkashin, “On the chromatic number of infinitesimal plane layer”, St. Petersburg Math. J., 29:5 (2018), 761–775
2017
24.
D. Cherkashin, S. Kryzhevich, “Weak forms of shadowing in topological dynamics”, Topological Methods in Nonlinear Analysis, 50:1 (2017), 125–150
2015
25.
D. D. Cherkashin, J. Kozik, “A note on random greedy coloring of uniform hypergraphs”, Random Structures & Algorithms, 47:3 (2015), 407–413
D. D. Cherkashin, A. B. Kulikov, A. M. Raigorodskii, “On hypergraph cliques with chromatic number 3 and a given number of vertices”, Trudy MFTI, 4:1 (2012), 151
2011
27.
D. D. Cherkashin, “On hypergraph cliques with chromatic number 3”, Moscow Journal of Combinatorics and Number Theory, 1:3 (2011), 3–11
28.
D. D. Cherkashin, A. B. Kulikov, O dvukhtsvetnykh raskraskakh gipergrafov, Doklady Akademii nauk, 436, no. 3, 2011
2024
Contact us: