Danila D. Cherkashin

According to our database, Danila D. Cherkashin authored at least 13 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Steiner trees with infinitely many terminals on the sides of an angle.

Danila D. Cherkashin, Emanuele Paolini, Yana Teplitskaya

J. Comb. Optim., April, 2025

Universal optimality of <i>T</i>-avoiding spherical codes and designs.

Peter G. Boyvalenkov, Danila D. Cherkashin, Peter D. Dragnev

CoRR, January, 2025

2024

On the Chromatic Number of 2-Dimensional Spheres.

Danila D. Cherkashin, Vsevolod A. Voronov

Discret. Comput. Geom., March, 2024

Erdős-Hajnal Problem for H-Free Hypergraphs.

Danila D. Cherkashin, Alexey Gordeev, Georgii Strukov

Graphs Comb., February, 2024

2023

On stability of spanning tree degree enumerators.

Danila D. Cherkashin, Fedor Petrov, Pavel Prozorov

Discret. Math., December, 2023

2022

On the Minimal Sum of Edges in a Signed Edge-Dominated Graph.

Danila D. Cherkashin, Pavel Prozorov

Electron. J. Comb., 2022

2020

Regular Behavior of the Maximal Hypergraph Chromatic Number.

Danila D. Cherkashin, Fedor Petrov

SIAM J. Discret. Math., 2020

2019

On small <i>n</i>-uniform hypergraphs with positive discrepancy.

Danila D. Cherkashin, Fedor Petrov

J. Comb. Theory B, 2019

Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs.

József Balogh, Danila D. Cherkashin, Sergei Kiselev

Eur. J. Comb., 2019

2018

A note on panchromatic colorings.

Danila D. Cherkashin

Discret. Math., 2018

On the chromatic numbers of small-dimensional Euclidean spaces.

Danila D. Cherkashin, Anatoly Kulikov, Andrei M. Raigorodskii

Discret. Appl. Math., 2018

Coloring Cross-Intersecting Families.

Danila D. Cherkashin

Electron. J. Comb., 2018

2015

A note on random greedy coloring of uniform hypergraphs.

Danila D. Cherkashin, Jakub Kozik

Random Struct. Algorithms, 2015