Covering boxes by points

Abstract Families of boxes in the d -dimensional Euclidean space are considered. A simple proof of an upper bound on the size of a minimum transversal in terms of the space dimension and the independence number of the intersection graph of the family is given. The proof uses an idea by Gyarfas and Lehel. Some examples are constructed, showing that in three instances this upper bound is exact.