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 2018 · math.COShow all

3 papers · 2 filters

math.CO2018

On a question of Sidorenko

D. Cherkashin, F. Petrov, V. Sokolov

For a positive integer $n > 1$ denote by $ω (n)$ the maximal possible number $k$ of different functions $f_{1}, \dots, f_{k} : Z / n Z \mapsto Z / n Z$ such that…

math.CO2018★ 2 cited

Regular behaviour of the maximal hypergraph chromatic number

Danila Cherkashin, Fedor Petrov

Let $m (n, r)$ denote the minimal number of edges in an $n$ -uniform hypergraph which is not $r$ -colorable. It is known that for a fixed $n$ one has \[ c_n r^n < m(n,r) < C_n r^n. \]…

math.CO2018

Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs

Jozsef Balogh, Danila Cherkashin, Sergei Kiselev

We suggest a new method on coloring generalized Kneser graphs based on hypergraphs with high discrepancy and small number of edges. The main result is providing a proper coloring o…