D. Cherkashin

activity

20112026

most citedAbout maximal number of edges in hypergraph-clique with chromatic number 3

3 citations · 7 across the 34 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 1 cited

Independence numbers of Johnson-type graphs

Danila Cherkashin, Sergei Kiselev

We consider a family of distance graphs in $R^{n}$ and find its independent numbers in some cases. Define graph $J_{\pm} (n, k, t)$ in the following way: the vertex set consist…

math.CO2019

On the Erd{\H o}s--Hajnal problem in the case of 3-graphs

Danila Cherkashin

Let $m (n, r)$ denote the minimal number of edges in an $n$ -uniform hypergraph which is not $r$ -colorable. For the broad history of the problem see [RaiSh]. It is known that for a fi…