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

3 papers · 2 filters

math.CO2026

A short proof of Oblakov's theorem

Danila Cherkashin

We give a short proof that for a given planar set of terminals $P$ there is at most one locally minimal tree with prescribed directions at $P$ (i.e. two locally minimal trees canno…

math.CO2026

On uniform eventowns

Danila Cherkashin, Pavel Prozorov

Suppose that $n = 2 m$ , $k = 2 t$ and $n > 10 k^{7}$ . We show that if a family $F$ of $k$ -subsets of an $n$ -set has only even pairwise intersections then $|\mathcal F| \leq \binom…

math.CO2026

Short proofs of three combinatorial results in the Johnson scheme

Danila Cherkashin, Yakov Shubin

In this note, we give short proofs of three theorems concerning extremal problems in the Johnson scheme, or, in other terminology, on $(n, k, L)$ -systems. The main result is a proof…