Borsuk's conjecture

Unsolved problem in mathematics:

What is the lowest

n

such that not every bounded subset

E

of the space

\mathbb {R} ^{n}

can be partitioned into (

n + 1

) sets, each of which has a smaller diameter than

E

?

(more unsolved problems in mathematics)

The Borsuk problem in geometry, for historical reasons^{[note 1]} incorrectly called Borsuk's conjecture, is a question in discrete geometry. It is named after Karol Borsuk.

^ Cite error: The named reference HinrRicht was invoked but never defined (see the help page).

Cite error: There are <ref group=note> tags on this page, but the references will not show without a {{reflist|group=note}} template (see the help page).

[HinrRicht-1] Cite error: The named reference HinrRicht was invoked but never defined (see the help page).

[note 1]

Borsuk's conjecture

From Wikipedia, the free encyclopedia · View on Wikipedia