Piercing families of convex sets in the plane that avoid a certain subfamily with lines
Abstract
We define a C(k) to be a family of k sets F1,…,Fk such that conv(Fi Fi+1) conv(Fj Fj+1)= when \i,i+1\ \j,j+1\= (indices are taken modulo k). We show that if F is a family of compact, convex sets that does not contain a C(k), then there are k-2 lines that pierce F. Additionally, we give an example of a family of compact, convex sets that contains no C(k) and cannot be pierced by k2 -1 lines.
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.