![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/6/65/Helly%2527s_theorem.svg/640px-Helly%2527s_theorem.svg.png&w=640&q=50)
Helly's theorem
Theorem about the intersections of d-dimensional convex sets / From Wikipedia, the free encyclopedia
Not to be confused with Helly's selection theorem.
Helly's theorem is a basic result in discrete geometry on the intersection of convex sets. It was discovered by Eduard Helly in 1913,[1] but not published by him until 1923, by which time alternative proofs by Radon (1921) and König (1922) had already appeared. Helly's theorem gave rise to the notion of a Helly family.
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/6/65/Helly%27s_theorem.svg/640px-Helly%27s_theorem.svg.png)