Danila Cherkashin

collaborators

3 papers

math.CO2023

On stability of weighted spanning tree degree enumerators

Danila Cherkashin, Pavel Prozorov

Our previous paper shows that the (vertex) spanning tree degree enumerator polynomial of a connected graph $G$ is a real stable polynomial (id est is non-zero if all variables have…

math.CO2023

On small non-uniform hypergraphs without property B

Danila Cherkashin

For a given hypergraph $H = (V, E)$ consider the sum $q (H)$ of $2^{- ∣ e ∣}$ over $e \in E$ . Consider the class of hypergraphs with the smallest edge of size $n$ and without a 2-colour…

math.CO2022

Erd\H os--Hajnal problem for $H$ -free hypergraphs

Danila Cherkashin, Alexei Gordeev, Georgii Strukov

This paper deals with the minimum number $m_{H} (r)$ of edges in an $H$ -free graph with the chromatic number more than $r$ . We show how bounds on Ramsey and Turán numbers imply bounds…

On stability of weighted spanning tree degree enumerators

On small non-uniform hypergraphs without property B

Erd\H os--Hajnal problem for H-free hypergraphs

Erd\H os--Hajnal problem for $H$ -free hypergraphs