A note on random greedy coloring of uniform hypergraphs. - Danila D. Cherkashin; Jakub Kozik (Random Struct. Algorithms, 2015)

Coloring Cross-Intersecting Families. - Danila D. Cherkashin (Electron. J. Comb., 2018)

On the chromatic numbers of small-dimensional Euclidean spaces. - Danila D. Cherkashin; Anatoly Kulikov; Andrei M. Raigorodskii (Discret. Appl. Math., 2018)

A note on panchromatic colorings. - Danila D. Cherkashin (Discret. Math., 2018)

Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs. - József Balogh; Danila D. Cherkashin; Sergei Kiselev (Eur. J. Comb., 2019)

On small n-uniform hypergraphs with positive discrepancy. - Danila D. Cherkashin; Fedor Petrov 001 (J. Comb. Theory B, 2019)

Regular Behavior of the Maximal Hypergraph Chromatic Number. - Danila D. Cherkashin; Fedor Petrov 001 (SIAM J. Discret. Math., 2020)

On the Minimal Sum of Edges in a Signed Edge-Dominated Graph. - Danila D. Cherkashin; Pavel Prozorov (Electron. J. Comb., 2022)

On stability of spanning tree degree enumerators. - Danila D. Cherkashin; Fedor Petrov 001; Pavel Prozorov (Discret. Math., 2023)

Erdős-Hajnal Problem for H-Free Hypergraphs. - Danila D. Cherkashin; Alexey Gordeev; Georgii Strukov (Graphs Comb., 2024)

On the Chromatic Number of 2-Dimensional Spheres. - Danila D. Cherkashin; Vsevolod A. Voronov (Discret. Comput. Geom., 2024)

Universal optimality of T-avoiding spherical codes and designs. - Peter G. Boyvalenkov; Danila D. Cherkashin; Peter D. Dragnev (CoRR, 2025)

Steiner trees with infinitely many terminals on the sides of an angle. - Danila D. Cherkashin; Emanuele Paolini; Yana Teplitskaya (J. Comb. Optim., 2025)