Piercing families of convex sets with the \(d\)-intersection property in \(\mathbb R^{d}\) (Q938308)

The piercing number \(\tau({\mathcal F})\) of a (finite) family \(\mathcal F\) of sets in \(\mathbb{R}^d\) is the minimum number of points needed to intersect every member of \(\mathcal F\). For special families \(\mathcal F\) of special compact convex sets in \(\mathbb{R}^d\), the author proves \(\tau({\mathcal F}) \leq d+1\) if for any nonempty subfamily \(\mathcal G\subset\mathcal F\) with \(| {\mathcal G}| \leq d\) the intersection \(\bigcap{\mathcal G}\) is not empty. The proofs use the same main idea as in the author's earlier paper [Discrete Comput. Geom. 24, No. 2--3, 345--353 (2000; Zbl 0959.52005)].