A counterexample to Borsuk's conjecture
| dc.creator | Kahn, Jeff | |
| dc.creator | Kalai, Gil | |
| dc.date | 1993-07-01 | |
| dc.date.accessioned | 2026-07-07T09:14:55Z | |
| dc.date.available | 2026-07-07T09:14:55Z | |
| dc.description | 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 large~$d$. | |
| dc.description | 3 pages | |
| dc.identifier | https://arxiv.org/abs/math/9307229 | |
| dc.identifier | http://arxiv.org/abs/math/9307229 | |
| dc.identifier | Bull. Amer. Math. Soc. (N.S.) 29 (1993) 60-62 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/152853 | |
| dc.subject | Metric Geometry | |
| dc.subject | Combinatorics | |
| dc.title | A counterexample to Borsuk's conjecture | |
| dc.type | text |