3 citations · 7 across the 34 of their papers we have counts for
41 papers
A short proof of Oblakov's theorem
Danila Cherkashin
We give a short proof that for a given planar set of terminals there is at most one locally minimal tree with prescribed directions at (i.e. two locally minimal trees canno…
On uniform eventowns
Danila Cherkashin, Pavel Prozorov
Suppose that , and . We show that if a family of -subsets of an -set has only even pairwise intersections then $|\mathcal F| \leq \binom…
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 -systems. The main result is a proof…
Universal Ahlfors--David regularity of Steiner trees
Danila Cherkashin, Pavel Prozorov, Yana Teplitskaya
The celebrated Steiner tree problem is the problem of finding a set of minimum one-dimensional Hausdorff measure (length) such that is connected, whe…
On the chromatic numbers of Johnson type graphs
Danila Cherkashin
A Johnson type graph is a graph whose vertex set consists of vectors from of the length and edges connect vertices with scalar product $t…
On branching points in the Gilbert-Steiner problem
Danila Cherkashin
The Gilbert--Steiner problem is a generalization of the Steiner tree problem and specific optimal mass transportation, which allows the use additional (branching) point in a transp…