Abstract
Let f(d) be the smallest number so that every set in Rd 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) ≥ (1.2)(Equation presented) for large d.
| Original language | English |
|---|---|
| Pages (from-to) | 60-62 |
| Number of pages | 3 |
| Journal | Bulletin of the American Mathematical Society |
| Volume | 29 |
| Issue number | 1 |
| DOIs |
|
| State | Published - Jul 1993 |
Fingerprint
Dive into the research topics of 'A counterexample to Borsuk’s conjecture'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver