Separating convex sets in the plane (Q1184162)

Given a family \(\mathcal F\) of \(n\) pairwise disjoint compact convex sets in the plane the authors ask for the maximum number \(k\) such that there exists a subfamily of \(k\) members of \(\mathcal F\) being separable by a line from one member of \(\mathcal F\). It is shown that \(k\geq \lceil{n-7\over 4}\rceil\) if \(\mathcal F\) consists of (circular) disks and that \(k\geq\lceil{n\over 3}\rceil+1\) if \(\mathcal F\) consists of segments extendable to semilines (remaining disjoint). Examples are given yielding upper bounds for \(k\), especially one showing the latter result to be tight.