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

DOI10.1017/CBO9781316106853.005zbMATH Open1361.51008arXiv1505.04952MaRDI QIDQ3179074FDOQ3179074

Gil Kalai

Publication date: 20 December 2016

Published in: Surveys in Combinatorics 2015 (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1505.04952

zbMATH Keywords

normcocyclemetriccoveringextremal set theoryBorsuk conjecturespherical setTurán number

Mathematics Subject Classification ID

Combinatorial geometries and geometric closure systems (51D20)

Cited In (10)

• On the multiple Borsuk numbers of sets
• Complete positivity and distance-avoiding sets
• The Borsuk and Hadwiger problems and systems of vectors with restrictions on scalar products
• A COUNTEREXAMPLE TO A CONJECTURE OF LARMAN AND ROGERS ON SETS AVOIDING DISTANCE 1
• Discrete geometry. Abstracts from the workshop held January 21--26, 2024
• Odd distances in colourings of the plane
• Graph and hypergraph colouring via nibble methods: a survey
• A problem of Füredi and Seymour on covering intersecting families by pairs
• On almost-equidistant sets. II
• Borsuk's partition problem and finite point sets

This page was built for publication: Some old and new problems in combinatorial geometry I: around Borsuk's problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179074)