3 citations · 7 across the 34 of their papers we have counts for
5 papers · 2 filters
On stability of spanning tree degree enumerators
Danila Cherkashin, Fedor Petrov, Pavel Prozorov
We show that the spanning tree degree enumerator polynomial of a connected graph is a real stable polynomial if and only if is distance-hereditary.
On the chromatic numbers of 3-dimensional slices
D. D. Cherkashin, A. J. Kanel-Belov, G. A. Strukov +1
We prove that for an arbitrary holds \[ χ(\mathbb{R}^3 \times [0,\varepsilon]^6) \geq 10, \] where stands for the chromatic number of an (infinite) graph w…
Erd\H os--Hajnal problem for -free hypergraphs
Danila Cherkashin, Alexei Gordeev, Georgii Strukov
This paper deals with the minimum number of edges in an -free graph with the chromatic number more than . We show how bounds on Ramsey and Turán numbers imply bounds…
On the chromatic number of 2-dimensional spheres
Danila Cherkashin, Vsevolod Voronov
In 1976 Simmons conjectured that every coloring of a 2-dimensional sphere of radius strictly greater than in three colors has a couple of monochromatic points at the distance…
Lov{á}sz theta approach to eventown problem
Mikhaylo Antipov, Danila Cherkashin
We apply the bound on independence number via Lov{á}sz theta function to eventown problem and its generalizations over .