Radon's partition theorem

Layer 0 — Mathematicsin the convex-geometry subtree

Radon 1921: any d+2 points in ℝ^d can be partitioned into two sets whose convex hulls intersect. Bridges Helly and Carathéodory. Tverberg 1966 generalisation: r-partition with common point exists for (d+1)(r-1)+1 points.

Related concepts

Explore Radon's partition theorem on the interactive knowledge graph →