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

DOI10.1017/CBO9781316106853.005MaRDI QIDQ3179074zbMATH OpenFDO

Authors Gil Kalai

Publication date 20 December 2016

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

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)

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.

Recommendations

• Around Borsuk's hypothesis
• scientific article; zbMATH DE number 718861
• On a bound in Borsuk's problem
• Borsuk's partition conjecture
• Bounds on Borsuk numbers in distance graphs of a special type

Cited in

(25)

• On the multiple Borsuk numbers of sets
• Complete positivity and distance-avoiding sets
• Unit and distinct distances in typical norms
• The Borsuk and Hadwiger problems and systems of vectors with restrictions on scalar products
• Borsuk and Ramsey type questions in Euclidean space
• Borsuk's problem, Boltyanski's illumination problem, and circumradius
• The Borsuk problem for some classes of (0,1)-polytopes
• Discrete geometry. Abstracts from the workshop held January 21--26, 2024
• Small volume bodies of constant width with tetrahedral symmetries
• Optimization hierarchies for distance-avoiding sets in compact spaces
• A note on Borsuk's problem in Minkowski spaces
• Counterexamples to Borsuk's conjecture with large girth
• A counterexample to a conjecture of Larman and Rogers on sets avoiding distance 1
• 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
• Topological methods in combinatorial problems
• On almost-equidistant sets. II
• Small volume bodies of constant width
• Borsuk's partition problem and finite point sets
• The problems of Borsuk and Grunbaum on lattice polytopes
• On multiple Borsuk numbers in normed spaces
• Convex bodies of constant width with exponential illumination number
• On the Borsuk and Grünbaum problems for (0,1)- and (-1,0,1)-polytopes in low-dimensional spaces
• Borsuk's problem

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)