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

3 papers · 2 filters

math.CO2017

Coloring cross-intersecting families

Danila Cherkashin

Intersecting and cross-intersecting families usually appear in extremal combinatorics in the vein of the Erd{\H o}s--Ko--Rado theorem. On the other hand, P.~Erd{\H o}s and L.~Lov{á…

math.CO2017

On small $n$ -uniform hypergraphs with positive discrepancy

Danila Cherkashin, Fedor Petrov

A two-coloring of the vertices $V$ of the hypergraph $H = (V, E)$ by red and blue has discrepancy $d$ if $d$ is the largest difference between the number of red and blue points in an…

math.CO2017

A note on panchromatic colorings

Danila Cherkashin

This paper studies the quantity $p (n, r)$ , that is the minimal number of edges of an $n$ -uniform hypergraph without panchromatic coloring (it means that every edge meets every color…

Coloring cross-intersecting families

On small n-uniform hypergraphs with positive discrepancy

A note on panchromatic colorings

On small $n$ -uniform hypergraphs with positive discrepancy