Originally posted on Combinatorics and more:

**Paul Erdős in Jerusalem, 1933 1993**

Update: Here is a link to a draft of a paper* based on the first part of this lecture. Some old and new problems in combinatorial geometry I: Around Borsuk’s problem.

I just came back from a great Erdős Centennial conference in wonderful Budapest. I gave a lecture on old and new problems (mainly) in combinatorics and geometry (here are the slides), where I presented twenty problems, here they are:

## Around Borsuk’s Problem

Let $latex f(d)$ be the smallest integer so that every set of diameter one in $latex R^d$ can be covered by $latex f(d)$ sets of smaller diameter. Borsuk conjectured that $latex f(d) \le d+1$.

It is known (Kahn and Kalai, 1993) that : $latex f(d) \ge 1.2^{\sqrt d}$, and also that (Schramm, 1989) $latex f(d) \le (\sqrt{3/2}+o(1))^d$.

**Problem 1:** Is *f(d)* exponential in *d*?

**Problem 2:** What is the smallest dimension…

View original 1,569 more words

## Leave a Reply