A 64-dimensional counterexample to Borsuk's conjecture

zbMath1311.51016arXiv1308.0206MaRDI QIDQ470955

Thomas Jenrich, Andries E. Brouwer

Publication date: 13 November 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Borsuk's conjectureSuzuki graphtwo-distance set

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Length, area and volume in real or complex geometry (51M25)

Related Items

Borsuk's partition problem in ℓₚ⁴, Implementing Brouwer's database of strongly regular graphs, Unnamed Item, On simplices in diameter graphs in \(\mathbb{R}^4\), Interview with Andrei Raigorodskii, Calculation of the Gromov-Hausdorff distance using the Borsuk number, On Boltyanski and Gohberg's partition conjecture, A 64-dimensional counterexample to Borsuk's conjecture, Cutting polygons into small pieces with chords: Laser-based localization, Borsuk's partition problem and finite point sets, On Borsuk's conjecture for two-distance sets, Ball packings with high chromatic numbers from strongly regular graphs, Partition bounded sets into sets having smaller diameters, Borsuk number for planar convex bodies, Borsuk's partition conjecture

Cites Work

• A 64-dimensional counterexample to Borsuk's conjecture
• Spectra of graphs
• Strongly regular graphs
• Three new distance-regular graphs
• Tight distance-regular graphs
• On Borsuk's conjecture for two-distance sets
• A counterexample to Borsuk’s conjecture
• Drei Sätze über die n-dimensionale euklidische Sphäre