arXiv Analytics

Sign in

arXiv:2204.10490 [math.CO]AbstractReferencesReviewsResources

Piercing families of convex sets in the plane that avoid a certain subfamily with lines

Daniel McGinnis

Published 2022-04-22Version 1

We define a $C(k)$ to be a family of $k$ sets $F_1,\dots,F_k$ such that $\textrm{conv}(F_i\cup F_{i+1})\cap \textrm{conv}(F_j\cup F_{j+1})=\emptyset$ when $\{i,i+1\}\cap \{j,j+1\}=\emptyset$ (indices are taken modulo $k$). We show that if $\mathcal{F}$ is a family of compact, convex sets that does not contain a $C(k)$, then there are $k-2$ lines that pierce $\mathcal{F}$. Additionally, we give an example of a family of compact, convex sets that contains no $C(k)$ and cannot be pierced by $\left\lceil \frac{k}{2} \right\rceil -1$ lines.

Comments: 9 pages, 9 figures
Categories: math.CO, math.MG
Subjects: 52A35
Related articles: Most relevant | Search more
arXiv:1612.03435 [math.CO] (Published 2016-12-11)
Depth with respect to a family of convex sets
arXiv:1102.0417 [math.CO] (Published 2011-02-02, updated 2011-10-22)
Intersection patterns of convex sets via simplicial complexes, a survey
arXiv:2010.13195 [math.CO] (Published 2020-10-25)
A family of convex sets in the plane satisfying the $(4,3)$-property can be pierced by nine points