3 citations · 4 across the 11 of their papers we have counts for
16 papers · 1 filter
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…
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…
The number of trees in distance-hereditary graphs and their friends
Danila Cherkashin, Pavel Prozorov
Counting the number of spanning trees in specific classes of graphs has attracted increasing attention in recent years. In this note, we present unified proofs and generalizations…
On set systems without singleton intersections
Danila Cherkashin
Consider a family of -subsets of an ambient -set such that no pair of -subsets in intersects in exactly one element. In this short note…