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:	28 (28)
in MathSciNet:	5 (5)
in zbMATH:	3 (3)
in Web of Science:	3 (3)
in Scopus:	3 (3)
Cited articles:	13
Citations:	176
Presentations:	5

Number of views:
This page:	770
Abstract pages:	1817
Full texts:	470
References:	193

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

List of publications on ZentralBlatt

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:

scientific publications

by years

by types

by times cited

common list

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

1.	P. K. Prozorov, D. D. Cherkashin, Izv. RAN. Ser. Mat. (to appear)

2024
2.	D, Cherkashin, V. Voronov, “On the chromatic number of 2-dimensional spheres”, Discrete & Computational Geometry, 71:2 (2024), 467–479	1 ^[x]
3.	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., “Erdő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 $https://doi.org/10.3390/fractalfract7050414$	1 ^[x]
8.	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, “Lovász theta approach to eventown problem”, Linear Algebra and its Applications, 655 (2022), 302–313	1 ^[x]
12.	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	3 ^[x]

2021
16.	D. .D. Cherkashin, “On the Erdö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	35 ^[x]
18.	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
19.	D. Cherkashin, A. Kulikov, A. Raigorodskii, “On the chromatic numbers of small-dimensional Euclidean spaces”, Discrete Applied Mathematics, 243 (2018), 125–131	42 ^[x]
20.	D. Cherkashin, “Coloring cross-intersecting families”, The Electronic Journal of Combinatorics, 25:1 (2018), P1.47	3 ^[x]
21.	D. Cherkashin, “A note on panchromatic colorings”, Discrete Mathematics, 341 (2018), 652–657	12 ^[x]
22.	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	30 ^[x]

2012
26.	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

Presentations in Math-Net.Ru

1.	Открытые задачи в раскрасках гиперграфов D. D. Cherkashin Contemporary Problems in Number Theory April 6, 2023 12:45
2.	Maximal distance minimizers for rectangle D. D. Cherkashin April 13, 2020 15:40
3.	Extremal problems in hypergraph colorings D. D. Cherkashin St. Petersburg Seminar on Representation Theory and Dynamical Systems March 14, 2018 17:00
4.	Экстремальные задачи в раскрасках гиперграфов D. D. Cherkashin Dobrushin Mathematics Laboratory Seminar December 19, 2017 16:00
5.	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