On covering a set of points by disks (Q2785015)

It is shown that for each finite set \(V\) in the plane there exist three (not necessarily distinct) points \(a,b,c\in V\) such that the three (circular) disks with diameters \([a,b], [b,c], [c,a]\) cover \(V\). This is shown by considering the points of \(V\) lying on the circumcircle of \(V\). NEWLINENEWLINENEWLINEAs a corollary it is deduced that one of the disks contains at least \(\frac{1}{3}\left|V\right|+1\) points of \(V\). This bound turns out to be sharp. To prove this, the following more general theorem is shown by a recursive construction: For each \(n\), there exists a set \(V_{n}\) of \(3n\) points in the plane, of diameter \(1\), such that every disk of diameter \(1\) contains at most \(n+1\) points of \(V_{n}\).