Piercing convex sets
Abstract
A family of sets has the (p,q) property if among any p members of the family some q have a nonempty intersection. It is shown that for every p q d+1 there is a c=c(p,q,d)<∞ such that for every family F of compact, convex sets in Rd that has the (p,q) property there is a set of at most c points in Rd that intersects each member of F. This extends Helly's Theorem and settles an old problem of Hadwiger and Debrunner.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.