A counterexample to Borsuk’s conjecture

DOI10.1090/S0273-0979-1993-00398-7zbMath0786.52002arXivmath/9307229OpenAlexW2106471982WikidataQ57382994 ScholiaQ57382994MaRDI QIDQ3138089

Gil Kalai, Jeffry 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

bibliography Borsuk's conjecture

Mathematics Subject Classification ID

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

Related Items

Borsuk's partition problem in ℓₚ⁴, Inscribing cubes and covering by rhombic dodecahedra via equivariant topology, A problem of Füredi and Seymour on covering intersecting families by pairs, Application of cut polyhedra. I, Lattice-free polytopes and their diameter, The Borsuk conjecture holds for bodies of revolution, Unnamed Item, On simplices in diameter graphs in \(\mathbb{R}^4\), On the Borsuk and Grünbaum problems for \((0,1)\)- and \((-1,0,1)\)-polytopes in low-dimensional spaces, Small subgraphs and their extensions in a random distance graph, Analog of Borsuk's problem on Banach spaces, On the chromatic number of an infinitesimal plane layer, The traveling salesman theorem for Jordan curves, Partitions of nonzero elements of a finite field into pairs, Borsuk's problem, Boltyanski's illumination problem, and circumradius, Intersecting families with sunflower shadows, An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges, On Schur's conjecture in \(\mathbb{R}^{4}\), Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors, Large cycles in generalized Johnson graphs, On Ramsey Type Problems in Combinatorial Geometry, Graph and hypergraph colouring via nibble methods: a survey, Interview with Andrei Raigorodskii, Interview with Gil Kalai, New bounds on clique-chromatic numbers of Johnson graphs, Calculation of the Gromov-Hausdorff distance using the Borsuk number, Independence numbers of Johnson-type graphs, A Result on Polynomials Derived Via Graph Theory, A quantitative program for Hadwiger's covering conjecture, Large simplices determined by finite point sets, Lower bound on the minimum number of edges in subgraphs of Johnson graphs, New sets with large Borsuk numbers, On Boltyanski and Gohberg's partition conjecture, On \(\mathbb R_p^n\)-analog of the Borsuk problem, On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems, Unnamed Item, The Argument Against Quantum Computers, Open problems in topology., Some analogues of the Borsuk problem in \(\mathbb Q^{n}\), A 64-dimensional counterexample to Borsuk's conjecture, 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, Exact modularity of line graphs of complete graphs, New lower bound on the modularity of Johnson graphs, Illuminating spindle convex bodies and minimizing the volume of spherical sets of constant width, Cutting polygons into small pieces with chords: Laser-based localization, Borsuk's partition problem and finite point sets, On the Borsuk and Erdős-Hadwiger numbers, Measurable sets with excluded distances, On Borsuk's conjecture for two-distance sets, Ball packings with high chromatic numbers from strongly regular graphs, The Borsuk conjecture holds for convex bodies with a belt of regular points, New estimates in the problem of the number of edges in a hypergraph with forbidden intersections, On the multiple Borsuk numbers of sets, The Borsuk partition problem: the seventieth anniversary, Modularity of some distance graphs, Bisections of centrally symmetric planar convex bodies minimizing the maximum relative diameter, Lower bounds on the clique-chromatic numbers of some distance graphs, Around Borsuk's hypothesis, The illumination conjecture for spindle convex bodies, Diameter graphs in \({\mathbb R}^4\), Chromatic numbers of Kneser-type graphs, Borsuk number for planar convex bodies, The plane-width of graphs, Borsuk's partition conjecture, New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\), Equilateral polygons in a Euclidean space and on deformed spheres via Fadell-Husseini index, Counterexamples to Borsuk's conjecture with large girth, 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, Borsuk's problem and the chromatic numbers of metric spaces, Spectrum of Johnson graphs, Borsuk's partition problem in \((\mathbb{R}^n,\ell_p)\), On Schur's conjecture in \(\mathbb R^4\), Independence numbers and chromatic numbers of some distance graphs

Cites Work