Piercing \(d\)-intervals (Q1387841)

This paper contains a very short elementary proof that if \({\mathcal H}\) is a finite family of \(d\)-intervals (a \(d\)-interval is a union of closed intervals in the line) containing no \(k+1\) pairwise disjoint members then the minimum number of points that intersect every member of \({\mathcal H}\) is \(\leq 2d^2k\).