On a bound in Borsuk's problem

DOI10.1070/rm1999v054n02ABEH000146zbMath0942.52004OpenAlexW2007545548MaRDI QIDQ4719727

Andrei M. Raigorodskii

Publication date: 10 January 2000

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/rm1999v054n02abeh000146

zbMATH Keywords

Borsuk's conjecturepartitions of sets

Mathematics Subject Classification ID

Partitions of sets (05A18) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Related Items (15)

On the measurable chromatic number of a space of dimension \(n \leq 24\) ⋮ Borsuk's problem, Boltyanski's illumination problem, and circumradius ⋮ An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges ⋮ On Ramsey Type Problems in Combinatorial Geometry ⋮ Interview with Andrei Raigorodskii ⋮ New sets with large Borsuk numbers ⋮ Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces ⋮ On the Borsuk and Erdős-Hadwiger numbers ⋮ On the multiple Borsuk numbers of sets ⋮ The Borsuk partition problem: the seventieth anniversary ⋮ On a series of Ramsey-type problems in combinatorial geometry ⋮ Around Borsuk's hypothesis ⋮ On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces ⋮ 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

This page was built for publication: On a bound in Borsuk's problem