Linked Data Explorer
A counterexample to Borsuk's conjecture
Abstract: "Let f(d) be the smallest number so that every set in R[superscript 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) [> or =] (1.1)[superscript the square root of d]."
- "Abstract: "Let f(d) be the smallest number so that every set in R[superscript 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) [> or =] (1.1)[superscript the square root of d].""@en
- "A counterexample to Borsuk's conjecture"@en