On uniqueness in Steiner problem

We prove that the set of $n$-point configurations for which solution of the planar Steiner problem is not unique has Hausdorff dimension is at most $2n-1$. Moreover, we show that the Hausdorff dimension of $n$-points configurations on which some locally minimal trees have the same length is also at most $2n-1$. Methods we use essentially requires some analytic structure and some finiteness, so that we prove a similar result for a complete Riemannian analytic manifolds under some apriori assumption on the Steiner problem on them

Independence numbers of Johnson-type graphs

We consider a family of distance graphs in $\mathbb{R}^n$ and find its independent numbers in some cases. Define graph $J_{\pm}(n,k,t)$ in the following way: the vertex set consists of all vectors from $\{-1,0,1\}^n$ with $k$ nonzero coordinates; edges connect the pairs of vertices with scalar product $t$. We find the independence number of $J_{\pm}(n,k,t)$ for $n > n_0 (k,t)$ in the cases $t = 0$ and $t = -1$; these cases for $k = 3$ are solved completely. Also the independence number is found for negative odd $t$ and $n > n_0 (k,t)$

On the chromatic number of 2-dimensional spheres

In 1976 Simmons conjectured that every coloring of a 2-dimensional sphere of radius strictly greater than $1/2$ in three colors has a couple of monochromatic points at the distance 1 apart. We prove this conjecture.Comment: 8