Persons: Cherkashin, Danila Dmitrievich

Persons

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Cherkashin, Danila Dmitrievich

Total publications:	33 (33)
in MathSciNet:	6 (6)
in zbMATH:	3 (3)
in Web of Science:	4 (4)
in Scopus:	4 (4)
Cited articles:	17
Citations:	189
Presentations:	6

Number of views:
This page:	1061
Abstract pages:	2871
Full texts:	916
References:	388

Associate professor

Candidate of physico-mathematical sciences

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:

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 $https://doi.org/10.3390/fractalfract7050414$
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

https://www.mathnet.ru/eng/person111820

List of publications on Google Scholar

https://elibrary.ru/author_items.asp?spin=3119-3707

https://orcid.org/0000-0002-8716-9794

https://www.webofscience.com/wos/author/record/HSH-5336-2023

https://www.scopus.com/authid/detail.url?authorId=37060672700

Full list of publications:

Download file (70 kB)

List of publications:

scientific publications

by years

by types

by times cited

common list

		Citations (Crossref Cited-By Service + Math-Net.Ru)


2025
1.	P. K. Prozorov, D. D. Cherkashin, “On stability of weighted spanning tree degree enumerators”, Izv. Math., 89:1 (2025), 106–124
2.	D. Cherkashin, E. Paolini, Y. Teplitskaya, “Steiner trees with infinitely many terminals on the sides of an angle”, Journal of Combinatorial Optimization, 49 (2025), #40
3.	P. Boyvalenkov, D. Cherkashin, “The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000”, Results in Mathematics, 80:1 (2025), #3
4.	P. K. Prozorov, D. D. Cherkashin, “On the minimal sum of weights of edges in a signed edge-dominated graph”, Mat. Zametki, 118:6 (2025) (to appear)
5.	D. Cherkashin, F. Petrov, “Branching points in the planar Gilbert–Steiner problem have degree 3”, Pure and Applied Functional Analysis, 10:2, Analysis and Related Topics Dedicated to the memory of Professor Anatoly Vershik (2025), 331–338 , arXiv: https://arxiv.org/pdf/2309.04202

2024
6.	D, Cherkashin, V. Voronov, “On the chromatic number of 2-dimensional spheres”, Discrete & Computational Geometry, 71:2 (2024), 467–479	1 ^[x]
7.	M. Basok, D. Cherkashin, N. Rastegaev, Y. Teplitskaya, “On uniqueness in Steiner problem”, International Mathematics Research Notices, 10 (2024), 8819–8838	1 ^[x]
8.	Cherkashin, D., Gordeev, A. & Strukov, G., “Erdős–Hajnal Problem for $H$-Free Hypergraphs”, Graphs and Combinatorics, 40 (2024), №10
9.	D. Cherkashin, “On set systems without singleton intersections”, Discrete Mathematics Letters, 14 (2024), 85-88	1 ^[x]

2023
10.	D. Cherkashin, F. Petrov, P. Prozorov, “On stability of spanning tree degree enumerators”, Discrete Mathematics, 346:12 (2023), 113629	2 ^[x]
11.	D. Cherkashin, S. Kiselev, “Independence Numbers of Johnson-Type Graphs”, Bulletin of the Brazilian Mathematical Society, New Series, 54:3 (2023), 30
12.	D. Cherkashin, Y. Teplitskaya, “A Self-Similar Infinite Binary Tree Is a Solution to the Steiner Problem”, Fractal and Fractional, 7:5 (2023), 414 $https://doi.org/10.3390/fractalfract7050414$	2 ^[x]
13.	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
14.	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
15.	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
16.	M. Antipov, D. Cherkashin, “Lovász theta approach to eventown problem”, Linear Algebra and its Applications, 655 (2022), 302–313	1 ^[x]
17.	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
18.	Cherkashin D. D., Gordeev A. S, “On list chromatic numbers of 2-colorable hypergraphs”, Trudy MFTI, 14:1 (53) (2022), 49–57

2020
19.	A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 89–146
20.	D. Cherkashin, F. Petrov,, “Regular behavior of the maximal hypergraph chromatic number”, SIAM Journal on Discrete Mathematics, 34:2 (2020), 1326–1333	3 ^[x]

2021
21.	D. .D. Cherkashin, “On the Erdös–Hajnal problem for 3-graphs”, Journal of Mathematical Sciences, 255 (2021), 103–108

2019
22.	J. Balogh, D. Cherkashin, S. Kiselev, “Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs”, European Journal of Combinatorics, 79 (2019), 228–236	38 ^[x]
23.	D. Cherkashin, F. Petrov, “On small $n$-uniform hypergraphs with positive discrepancy”, Journal of Combinatorial Theory, Series B, 139 (2019), 353–359	13 ^[x]

2018
24.	D. Cherkashin, A. Kulikov, A. Raigorodskii, “On the chromatic numbers of small-dimensional Euclidean spaces”, Discrete Applied Mathematics, 243 (2018), 125–131	42 ^[x]
25.	D. Cherkashin, “Coloring cross-intersecting families”, The Electronic Journal of Combinatorics, 25:1 (2018), P1.47	3 ^[x]
26.	D. Cherkashin, “A note on panchromatic colorings”, Discrete Mathematics, 341 (2018), 652–657	12 ^[x]
27.	D. Cherkashin, Y. Teplitskaya, “On the horseshoe conjecture for maximal distance minimizers”, ESAIM: Control, Optimisation and Calculus of Variations, 24:3 (2018), 1015–1041	1 ^[x]
28.	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
29.	D. Cherkashin, S. Kryzhevich, “Weak forms of shadowing in topological dynamics”, Topological Methods in Nonlinear Analysis, 50:1 (2017), 125–150

2015
30.	D. D. Cherkashin, J. Kozik, “A note on random greedy coloring of uniform hypergraphs”, Random Structures & Algorithms, 47:3 (2015), 407–413	30 ^[x]

2012
31.	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
32.	D. D. Cherkashin, “On hypergraph cliques with chromatic number 3”, Moscow Journal of Combinatorics and Number Theory, 1:3 (2011), 3–11
33.	D. D. Cherkashin, A. B. Kulikov, O dvukhtsvetnykh raskraskakh gipergrafov, Doklady Akademii nauk, 436, no. 3, 2011

Presentations in Math-Net.Ru

1.	The number of spanning trees in a graph D. D. Cherkashin Joint Mathematical seminar of Saint Petersburg State University and Peking University June 19, 2025 16:00
2.	Открытые задачи в раскрасках гиперграфов D. D. Cherkashin Contemporary Problems in Number Theory April 6, 2023 12:45
3.	Maximal distance minimizers for rectangle D. D. Cherkashin April 13, 2020 15:40
4.	Extremal problems in hypergraph colorings D. D. Cherkashin St. Petersburg Seminar on Representation Theory and Dynamical Systems March 14, 2018 17:00
5.	Экстремальные задачи в раскрасках гиперграфов D. D. Cherkashin Dobrushin Mathematics Laboratory Seminar December 19, 2017 16:00
6.	Colorings of n-homogeneous hypergraphs D. Cherkashin St. Petersburg Seminar on Representation Theory and Dynamical Systems April 22, 2015 17:00

Organisations

Registration to the website

Logotypes