Running summarizing tools on a new article

Check the paper below, then start its synthesis.


Some old and new problems in combinatorial geometry I: Around Borsuk's problem

Gil Kalai

This is a draft of a chapter for "Surveys in Combinatorics 2015," edited by Artur Czumaj, Angelos Georgakopoulos, Daniel Kral, Vadim Lozin, and Oleg Pikhurko. The final published version shall be available for purchase from Cambridge University Press

Abstract: 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 questions related to Borsuk's problem.

Submitted to arXiv on 19 May. 2015