A counterexample to Borsuk’s conjecture

DOI10.1090/S0273-0979-1993-00398-7zbMATH Open0786.52002arXivmath/9307229OpenAlexW2106471982WikidataQ57382994 ScholiaQ57382994MaRDI QIDQ3138089FDOQ3138089

J. Kahn, Gil Kalai

Publication date: 6 May 1994

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

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$.

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

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

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)

Cites Work

• Forbidden Intersections
• Intersection theorems with geometric consequences
• The realization of distances within sets in Euclidean space
• Unsolved problems in geometry
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Illuminating sets of constant width
• A fractional version of the Erdős-Faber-Lovász conjecture
• Title not available (Why is that?)
• A problem of Füredi and Seymour on covering intersecting families by pairs
• Title not available (Why is that?)

Cited In (94)

• Title not available (Why is that?)
• An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
• Title not available (Why is that?)
• Independence numbers and chromatic numbers of some distance graphs
• On Ramsey Type Problems in Combinatorial Geometry
• Bisections of centrally symmetric planar convex bodies minimizing the maximum relative diameter
• 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
• 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
• 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
• Large cycles in generalized Johnson graphs
• Sets with large Borsuk number
• A counterexample to the finite height conjecture
• Inscribing cubes and covering by rhombic dodecahedra via equivariant topology
• On \(\mathbb R_p^n\)-analog of the Borsuk problem
• On Schur's conjecture in \(\mathbb{R}^{4}\)
• Some structural properties of two counter-examples to the Baker-Gammel-Wills conjecture.
• On the Borsuk and Erdős-Hadwiger numbers
• Title not available (Why is that?)
• 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
• Block partitions: an extended view
• Diameter graphs in \({\mathbb R}^4\)
• Borsuk number for planar convex bodies
• A counterexample to the bipartizing matching conjecture
• The Borsuk partition problem: the seventieth anniversary
• A Result on Polynomials Derived Via Graph Theory
• Application of cut polyhedra. I
• Measurable sets with excluded distances
• A minimal counterexample to universal baireness
• Title not available (Why is that?)
• A 64-dimensional counterexample to Borsuk's conjecture
• A counterexample to a discrete Korovkin theorem
• Large simplices determined by finite point sets
• Around Borsuk's hypothesis
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• Illuminating spindle convex bodies and minimizing the volume of spherical sets of constant width
• Spherical codes and Borsuk's conjecture
• Borsuk's partition problem in ℓₚ⁴
• A problem of Füredi and Seymour on covering intersecting families by pairs
• Partitions of nonzero elements of a finite field into pairs
• On Schur's conjecture in \(\mathbb R^4\)
• Open problems in topology.
• On simplices in diameter graphs in \(\mathbb{R}^4\)
• Borsuk's problem and the chromatic numbers of metric spaces
• The illumination conjecture for spindle convex bodies
• Borsuk's partition problem and finite point sets
• Lattice-free polytopes and their diameter
• The Borsuk conjecture holds for bodies of revolution
• Some analogues of the Borsuk problem in \(\mathbb Q^{n}\)
• The plane-width of graphs
• A counterexample to a conjecture of U. Pinkall
• On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems
• The Borsuk conjecture holds for convex bodies with a belt of regular points
• New sets with large Borsuk numbers
• Analog of Borsuk's problem on Banach spaces
• 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
• The Argument Against Quantum Computers
• Title not available (Why is that?)
• Intersecting families with sunflower shadows
• On the chromatic number of an infinitesimal plane layer
• Spectrum of Johnson graphs
• Borsuk's partition problem in \((\mathbb{R}^n,\ell_p)\)
• Title not available (Why is that?)
• Small subgraphs and their extensions in a random distance graph
• Cutting polygons into small pieces with chords: Laser-based localization
• Lower bound on the minimum number of edges in subgraphs of Johnson graphs
• New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
• Borsuk's problem, Boltyanski's illumination problem, and circumradius
• Title not available (Why is that?)
• New bounds on clique-chromatic numbers of Johnson graphs
• On Boltyanski and Gohberg's partition conjecture
• A counter-example to Batson's conjecture
• Lower bounds on the clique-chromatic numbers of some distance graphs
• Counterexamples to Borsuk's conjecture with large girth
• Graph and hypergraph colouring via nibble methods: a survey
• Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph
• The traveling salesman theorem for Jordan curves
• Modularity of some distance graphs
• Interview with Andrei Raigorodskii
• Interview with Gil Kalai
• New lower bound on the modularity of Johnson graphs
• Equilateral polygons in a Euclidean space and on deformed spheres via Fadell-Husseini index
• On Borsuk's conjecture for some sets with nonsmooth boundary
• Calculation of the Gromov-Hausdorff distance using the Borsuk number
• Independence numbers of Johnson-type 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)