Around Borsuk's hypothesis
From MaRDI portal
Publication:2519261
In 1933 K.~Borsuk posed the question: Is it true that every bounded set in \(\mathbb{R}^{n}\) admits a partition into \(n+1\) parts of smaller diameter? The problem attracted many researchers, among them were prominent mathematicians. Numerous methods and results arose when making attempts to solve the problem. The hypothesis (conjecture) was proved for \(n=2\), 3 and for some special classes of sets. In 1993 counterexamples (for rather large dimensions \(n\)) were constructed answering the question negative. The paper under review surveys numerous general approaches to solving Borsuk's problem, involving several other classical problems. Many interesting results that have some connection with Borsuk's problem are discussed. Below the contents of the article are given: Introduction 1. Notation and various versions of problem formulation 2. Universal covers 3. Universal covering systems 4. Truncations of an octahedron 5. Spherical u.c.s. in dimension 3 6. Sets of constant width 7. Covering the sets by balls 8. Special classes of sets 9. Counterexamples to Borsuk's hypothesis 10. Borsuk's, Grünbaum's, and the Nelson--Erdös--Hadwiger problems for lattice polyhedra and graphs 11. Chromatic numbers of finite geometric graphs and the relation between the Borsuk and Nelson--Erdös--Hadwiger problems References The bibliography includes 123 sources.
Recommendations
Cites work
- A counterexample to Borsuk’s conjecture
- A note on the realization of distances within sets in euclidean space
- Affine images of the rhombo-dodecahedron that are circumscribed about a three-dimensional convex body
- Affine-inscribed and affine-circumscribed polygons and polytopes
- Ausgewählte Probleme der kombinatorischen Geometrie des Euklidischen und sphärischen Raumes
- Borsuk's problem and the chromatic numbers of some metric spaces
- Combinatorial problems on the illumination of convex bodies
- Covering a sphere with spheres
- Covering a Three-Dimensional set with Sets of Smaller Diameter
- Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
- Erdös–Ko–Rado Theorem—22 Years Later
- Excursions into combinatorial geometry
- Extremal problems and coverings of the space
- scientific article; zbMATH DE number 3122841 (Why is no real title available?)
- scientific article; zbMATH DE number 4161560 (Why is no real title available?)
- scientific article; zbMATH DE number 3812415 (Why is no real title available?)
- scientific article; zbMATH DE number 3987367 (Why is no real title available?)
- scientific article; zbMATH DE number 4043856 (Why is no real title available?)
- scientific article; zbMATH DE number 4058317 (Why is no real title available?)
- scientific article; zbMATH DE number 1188564 (Why is no real title available?)
- scientific article; zbMATH DE number 3675897 (Why is no real title available?)
- scientific article; zbMATH DE number 3726376 (Why is no real title available?)
- scientific article; zbMATH DE number 177380 (Why is no real title available?)
- scientific article; zbMATH DE number 718861 (Why is no real title available?)
- scientific article; zbMATH DE number 1538119 (Why is no real title available?)
- scientific article; zbMATH DE number 1775058 (Why is no real title available?)
- scientific article; zbMATH DE number 1567877 (Why is no real title available?)
- scientific article; zbMATH DE number 865987 (Why is no real title available?)
- scientific article; zbMATH DE number 1406330 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- scientific article; zbMATH DE number 3243107 (Why is no real title available?)
- scientific article; zbMATH DE number 3311395 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- Intersection Properties of Systems of Finite Sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems with geometric consequences
- Matroidal bijections between graphs
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- New sets with large Borsuk numbers
- On a bound in Borsuk's problem
- On Inscribing n-Dimensional Sets in a Regular n-Simplex
- On Sets of Distances of n Points
- On t-designs
- On the chromatic number of a space
- On the chromatic number of cube-like graphs
- On the closets packing of spheres in \(n\) dimensions
- On the dimension in Borsuk's problem
- Sets with large Borsuk number
- Small universal covers for sets of unit diameter
- Spherical codes and Borsuk's conjecture
- Symmetrical sets of constant width and their partitions
- The Borsuk partition problem: the seventieth anniversary
- The chromatic number of a space with the metric l_q
- The chromatic number of random graphs
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The connection between the Borsuk and Erdös-Hadwiger problems
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
- The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
- The exact bound in the Erdős-Ko-Rado theorem
- The realization of distances within sets in Euclidean space
- Zum Borsukschen Zerteilungsproblem
- Zur Zerlegung von Punktmengen in solche kleineren Durchmessers
- Über die Bedeckung ebener Punktmengen durch solche kleineren Durchmessers
- Über ein euklidisch-geometrisches Problem von B. Grünbaum
- Überdeckung einer Menge durch Mengen kleineren Durchmessers
Cited in
(52)- Borsuk covering and planar sets with unique completion
- Sets with large Borsuk number
- Diameters of random distance graphs
- On the Borsuk problem in \(\mathbb R^ 3\).
- Borsuk's partition problem and finite point sets
- On the multiple Borsuk numbers of sets
- Bounds on Borsuk numbers in distance graphs of a special type
- Borsuk's partition conjecture
- On the minimal number of edges in induced subgraphs of special distance graphs
- Estimate of the number of edges in special subgraphs of a distance graph
- New bounds on clique-chromatic numbers of Johnson graphs
- Exact modularity of line graphs of complete graphs
- New lower bound on the modularity of Johnson graphs
- On Borsuk's conjecture for two-distance sets
- One problem on geometric Ramsey numbers
- Exponentially Ramsey sets
- On threshold probability for the stability of independent sets in distance graphs
- Counterexamples to Borsuk's conjecture with large girth
- Lower bounds for the chromatic numbers of distance graphs with large girth
- Independence numbers and chromatic numbers of some distance graphs
- Small subgraphs in random distance graphs
- Some old and new problems in combinatorial geometry. I: Around Borsuk's problem
- On the number of edges in induced subgraphs of a special distance graph
- Independence numbers of random subgraphs of distance graphs
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- The problems of Borsuk and Grunbaum on lattice polytopes
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- On the Borsuk and Grünbaum problems for (0,1)- and (-1,0,1)-polytopes in low-dimensional spaces
- New bounds for the distance Ramsey number
- On Schur's conjecture in \(\mathbb{R}^{4}\)
- scientific article; zbMATH DE number 2070003 (Why is no real title available?)
- scientific article; zbMATH DE number 1544962 (Why is no real title available?)
- scientific article; zbMATH DE number 1775058 (Why is no real title available?)
- On the Frankl-Rödl theorem
- Gromov-Hausdorff distances to simplexes and some applications to discrete optimisation
- On rational analogs of Nelson-Hadwiger's and Borsuk's problems
- Three lectures on the Borsuk partition problem
- Borsuk's problem
- Calculation of the Gromov-Hausdorff distance using the Borsuk number
- On the partition of plane sets into 6 subsets of small diameter
- Modularity of some distance graphs
- A quantitative program for Hadwiger's covering conjecture
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
- On two-distance (0,1)-counterexamples to Borsuk's conjecture in l_p metrics
- The minimum number of cliques in induced subgraphs of Johnson graphs
- Metric space recognition by Gromov-Hausdorff distances to simplexes
- Embeddings to rectilinear space and Gromov-Hausdorff distances
- Proof of Schur's conjecture in R^D
- On upper bounds for the number of parts in the problem of partitioning sets into parts of smaller diameter
- Hamiltonian paths in distance graphs
This page was built for publication: Around Borsuk's hypothesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2519261)
