In discrete geometry, Tverberg's theorem, first stated by Helge Tverberg in 1966, is the result that sufficiently many points in Euclidean space can be partitioned into subsets with intersecting convex hulls. Specifically, for any positive integers d , r {\displaystyle d,r} and any set of
( d + 1 ) ( r − 1 ) + 1 {\displaystyle (d+1)(r-1)+1\ }
points in d {\displaystyle d} -dimensional Euclidean space there exists a partition of the given points into r {\displaystyle r} subsets whose convex hulls all have a common point; in other words, there exists a point x {\displaystyle x} (not necessarily one of the given points) such that x {\displaystyle x} belongs to the convex hull of all of the subsets. The partition resulting from this theorem is known as a Tverberg partition. The special case r = 2 {\displaystyle r=2} was proved earlier by Radon, and it is known as Radon's theorem.
Examples The case d = 1 {\displaystyle d=1} states that any 2 r − 1 {\displaystyle 2r-1} points on the real line can be partitioned into r {\displaystyle r} subsets with intersecting convex hulls. Indeed, if the points are x 1 < x 2 < . . . < x 2 r − 1 {\displaystyle x_{1}<x_{2}<...<x_{2r-1}} , then the partition into A i = { x i , x 2 r − i } {\displaystyle A_{i}=\{x_{i},x_{2r-i}\}} for i = 1 , . . . , r {\displaystyle i=1,...,r} satisfies this condition (and it is unique). For r = 2 {\displaystyle r=2} Tverberg's theorem states that any d + 2 {\displaystyle d+2} points in the d {\displaystyle d} -dimensional Euclidean space may be partitioned into two subsets with intersecting convex hulls. This is known as Radon's theorem. In this case, for points in general position, the partition is unique. The case r = 3 {\displaystyle r=3} and d = 2 {\displaystyle d=2} states that any seven points in the plane may be partitioned into three subsets with intersecting convex hulls. The illustration shows an example in which the seven points are the vertices of a regular heptagon. As the example shows, there may be many different Tverberg partitions of the same set of points; these seven points may be partitioned in seven different ways that differ by rotations of each other.
… excerpt ends here. Continue reading the full article.


