A counterexample to Borsuk’s conjecture

DOI10.1090/S0273-0979-1993-00398-7MaRDI QIDQ3138089zbMATH OpenOpenAlexWikidataFDO

Authors Gil Kalai, J. Kahn

Publication date 6 May 1994

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

bibliographyBorsuk's conjecture

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Extremal set theory (05D05) Other problems of combinatorial convexity (52A37)

Abstract: Let $f(d)$ be the smallest number so that every set in $R^d$ of diameter 1 can be partitioned into $f(d)$ sets of diameter smaller than 1. Borsuk's conjecture was that $f(d)!=!d!+!1$. We prove that $f(d)!ge!(1.2{)}^{sqrtd}$ for large~$d$.

Recommendations

• A counter example on a Borsuk conjecture
• A counterexample to Bueler’s conjecture
• scientific article; zbMATH DE number 1033822
• A Counterexample to Orlik's Conjecture
• A counter-example to Batson's conjecture
• A counterexample to Raikov's conjecture
• A counterexample to a conjecture by Błocki-Zwonek
• A counterexample to Durfee's conjecture
• A Counterexample to a conjecture of Bosio and Meersseman
• A counter-example to Hausmann's conjecture

Cites work

• scientific article; zbMATH DE number 3812415 (Why is no real title available?)
• scientific article; zbMATH DE number 3762003 (Why is no real title available?)
• scientific article; zbMATH DE number 177380 (Why is no real title available?)
• scientific article; zbMATH DE number 3243107 (Why is no real title available?)
• scientific article; zbMATH DE number 3269673 (Why is no real title available?)
• A fractional version of the Erdős-Faber-Lovász conjecture
• A problem of Füredi and Seymour on covering intersecting families by pairs
• Forbidden Intersections
• Illuminating sets of constant width
• Intersection theorems with geometric consequences
• The realization of distances within sets in Euclidean space
• Unsolved problems in geometry

Cited in

(96)

• scientific article; zbMATH DE number 9130 (Why is no real title available?)
• An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
• Intersecting families with sunflower shadows
• Independence numbers and chromatic numbers of some distance graphs
• scientific article; zbMATH DE number 2070003 (Why is no real title available?)
• scientific article; zbMATH DE number 3888433 (Why is no real title available?)
• Bisections of centrally symmetric planar convex bodies minimizing the maximum relative diameter
• On Ramsey Type Problems in Combinatorial Geometry
• On the multiple Borsuk numbers of sets
• Counterexamples to Borsuk's conjecture on spheres of small radius
• A quantitative program for Hadwiger's covering conjecture
• On the chromatic number of an infinitesimal plane layer
• Spectrum of Johnson graphs
• Borsuk's partition problem in \((\mathbb{R}^n,\ell_p)\)
• New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
• New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
• Chromatic numbers of Kneser-type graphs
• Counterexamples to Borsuk's conjecture on spheres of small radii
• New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
• Exact modularity of line graphs of complete graphs
• Sets with large Borsuk number
• A counterexample to the finite height conjecture
• Large cycles in generalized Johnson graphs
• Inscribing cubes and covering by rhombic dodecahedra via equivariant topology
• On Schur's conjecture in \(\mathbb{R}^{4}\)
• On \(\mathbb R_p^n\)-analog of the Borsuk problem
• Small subgraphs and their extensions in a random distance graph
• Some structural properties of two counter-examples to the Baker-Gammel-Wills conjecture.
• On the Borsuk and Erdős-Hadwiger numbers
• scientific article; zbMATH DE number 59019 (Why is no real title available?)
• Block partitions: an extended view
• Diameter graphs in \({\mathbb R}^4\)
• On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem
• Cutting polygons into small pieces with chords: Laser-based localization
• Borsuk number for planar convex bodies
• A counterexample to the bipartizing matching conjecture
• Lower bound on the minimum number of edges in subgraphs of Johnson graphs
• The Borsuk partition problem: the seventieth anniversary
• New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
• Application of cut polyhedra. I
• The argument against quantum computers
• Borsuk's problem, Boltyanski's illumination problem, and circumradius
• New bounds on clique-chromatic numbers of Johnson graphs
• Measurable sets with excluded distances
• A counter-example to Batson's conjecture
• Lower bounds on the clique-chromatic numbers of some distance graphs
• A minimal counterexample to universal baireness
• scientific article; zbMATH DE number 1033822 (Why is no real title available?)
• On Boltyanski and Gohberg's partition conjecture
• A 64-dimensional counterexample to Borsuk's conjecture
• Gromov-Hausdorff distances to simplexes and some applications to discrete optimisation
• A counterexample to a discrete Korovkin theorem
• Large simplices determined by finite point sets
• Illuminating spindle convex bodies and minimizing the volume of spherical sets of constant width
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• Around Borsuk's hypothesis
• Bounds on Borsuk numbers in distance graphs of a special type
• Counterexamples to Borsuk's conjecture with large girth
• Spherical codes and Borsuk's conjecture
• Graph and hypergraph colouring via nibble methods: a survey
• A problem of Füredi and Seymour on covering intersecting families by pairs
• Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph
• Borsuk's partition problem in ℓₚ⁴
• Partitions of nonzero elements of a finite field into pairs
• On Schur's conjecture in \(\mathbb R^4\)
• Open problems in topology.
• The traveling salesman theorem for Jordan curves
• On simplices in diameter graphs in \(\mathbb{R}^4\)
• The illumination conjecture for spindle convex bodies
• Borsuk's problem and the chromatic numbers of metric spaces
• Borsuk's partition problem and finite point sets
• Modularity of some distance graphs
• Lattice-free polytopes and their diameter
• Interview with Andrei Raigorodskii
• Interview with Gil Kalai
• The Borsuk conjecture holds for bodies of revolution
• New lower bound on the modularity of Johnson graphs
• Some analogues of the Borsuk problem in \(\mathbb Q^{n}\)
• Equilateral polygons in a Euclidean space and on deformed spheres via Fadell-Husseini index
• A result on polynomials derived via graph theory
• On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems
• The plane-width of graphs
• A counterexample to a conjecture of U. Pinkall
• The Borsuk conjecture holds for convex bodies with a belt of regular points
• On minrank and the Lovász theta-function
• On Borsuk's conjecture for some sets with nonsmooth boundary
• New sets with large Borsuk numbers
• Analog of Borsuk's problem on Banach spaces
• Calculation of the Gromov-Hausdorff distance using the Borsuk number
• Independence numbers of Johnson-type graphs
• On the Borsuk and Grünbaum problems for \((0,1)\)- and \((-1,0,1)\)-polytopes in low-dimensional spaces
• Borsuk's partition conjecture
• A counterexample to a question of Bapat and Sunder
• On Borsuk's conjecture for two-distance sets
• On a bound in Borsuk's problem
• Ball packings with high chromatic numbers from strongly regular graphs

This page was built for publication: A counterexample to Borsuk’s conjecture

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