Birth date: 12.10.1992
E-mail:
Keywords: Hypergraph coloring, chromatic numbers of metric spaces, Steiner problem, maximal distance minimizers

Subject:

Combinatorics, combinatoric geometry, geometric optimization

Main publications:

1. D. Cherkashin, S. Kiselev, “Independence Numbers of Johnson-Type Graphs”, Bulletin of the Brazilian Mathematical Society, New Series, 54:3 (2023), 30  
2. D. Cherkashin, Y. Teplitskaya, “A Self-Similar Infinite Binary Tree Is a Solution to the Steiner Problem”, Fractal and Fractional, 7:5 (2023), 414  
3. A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 89–146                  
4. D. Cherkashin, F. Petrov,, “Regular behavior of the maximal hypergraph chromatic number”, SIAM Journal on Discrete Mathematics, 34:2 (2020), 1326–1333  
5. D. Cherkashin, Y. Teplitskaya, “On the horseshoe conjecture for maximal distance minimizers”, ESAIM: Control, Optimisation and Calculus of Variations, 24:3 (2018), 1015–1041  
6. D. D. Cherkashin, J. Kozik, “A note on random greedy coloring of uniform hypergraphs”, Random Structures & Algorithms, 47:3 (2015), 407–413          

Recent publications

Presentations in Math-Net.Ru

Personal pages:

• 
• 
• 
• 
• 

Organisations:

• Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
• Saint Petersburg State University
• National Research University "Higher School of Economics", St. Petersburg Branch
• St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences
• Chebyshev Laboratory, St. Petersburg State University, Department of Mathematics and Mechanics
• Lab of advanced combinatorics and network applications, Moscow Institute of Physics and Technology (State University)