Related papers: The Borsuk Problem for Subsets of the Vertices of …
In 1933, K. Borsuk proposed the following problem: Can every bounded set in $\mathbb{E}^n$ be divided into $n+1$ subsets of smaller diameters? In 1965, V. G. Boltyanski and I. T. Gohberg made the following conjecture: Every bounded set in…
Borsuk conjectured that every n-dimensional bounded set of positive diameter can be partitioned into n+1 sets of smaller diameters. This conjecture was proved for n=2 by Borsuk, for n=3 first by Eggleston, and disproved for n > 297 by…
In 1933, Borsuk proposed the following problem: Can every bounded set in $\mathbb{E}^n$ be divided into $n+1$ subsets of smaller diameters? This problem has been studied by many authors, and a lot of partial results have been discovered. In…
It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…
The Borsuk problem asks for the smallest number of subsets with strictly smaller diameters into which any bounded set in the $d$-dimensional space can be decomposed. It is a classical problem in combinatorial geometry that has been subject…
Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…
Borsuk's conjecture states that any bounded set in R^n can be partitioned into n+1 sets of smaller diameter. It is known to be false for all n bigger or equal to 323. Here we show that Borsuk's conjecture fails in dimensions 321 and 322.…
In the present paper, we study problems related to the classical Borsuk's problem. Recall that the Borsuk's problem consists in finding the smallest number $ f(n) $ of parts of smaller diameter into which an arbitrary set of diameter 1 in…
In 1933, Borsuk conjectured that any bounded d-dimensional set of nonzero diameter can be broken into d + 1 parts of smaller diameter. This conjecture was disproved for large enough d, though it is true for low dimensional cases. The paper…
Classical Borsuk problem asks about the minimal number of closed subsets of smaller diameter necessary to partition every compact in the Euclidean space. Topological version of the Borsuk problem is discussed.
The Borsuk number $b(n)$ of $n$-dimensional Euclidean space $\mathbb{R}^n$ is the smallest integer such that any set $F \subset \mathbb{R}^n$ of unit diameter can be partitioned into $b(n)$ subsets of strictly smaller diameter. For $n=4$,…
In this work, the classical Borsuk conjecture is discussed, which states that any set of diameter 1 in the Euclidean space $ {\mathbb R}^d $ can be divided into $ d+1 $ parts of smaller diameter. During the last two decades, many…
In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean space can be divided into n+1 parts of smaller diameter. The diameter of a set is defined as the supremum (least upper bound) of the distances of contained…
The Borsuk number of a set S of diameter d >0 in Euclidean n-space is the smallest value of m such that S can be partitioned into m sets of diameters less than d. Our aim is to generalize this notion in the following way: The k-fold Borsuk…
In 1933, Karol Borsuk asked whether each bounded set in the $n$-dimensional Euclidean space can be divided into $n$+1 parts of smaller diameter. Because it would not make sense otherwise, one usually assumes that he just forgot to require…
Every graph G can be embedded in a Euclidean space as a two-distance set. This allows us to reformulate the analogue of Borsuk's conjecture for two-distance sets in terms of graphs. This conjecture remains open for dimensions from 4 to 63.…
The lattice diameter of a bounded set $S \subset \mathbb{R}^d$ measures the maximal number of lattice points in a segment whose endpoints are lattice points in $S$. Such a segment is called a lattice diameter segment of $S$. This simple…
Let $f(d)$ be the smallest number so that every set in $R^d$ of diameter 1 can be partitioned into $f(d)$ sets of diameter smaller than 1. Borsuk's conjecture was that $f(d)\! =\!d\!+\!1$. We prove that $f(d)\! \ge\! (1.2)^{\sqrt d}$ for…
Let $P$ be a poset of size $2^k$ that has a greatest and a least element. We prove that, for sufficiently large $n$, the Boolean lattice $2^{[n]}$ can be partitioned into copies of $P$. This resolves a conjecture of Lonc.
Borsuk asked in 1933 if every set of diameter 1 in $R^d$ can be covered by $d+1$ sets of smaller diameter. In 1993, a negative solution, based on a theorem by Frankl and Wilson, was given by Kahn and Kalai. In this paper I will present…