For any natural number , a family of subsets of a space is said to be {\em -pierceable}, if there exists with such that for any , .
Helly's theorem, one of the fundamental results in discrete geometry, says that for any finite family of convex sets in , if every -tuple from is -pierceable, then the whole family is -pierceable. Unfortunately, for , a similar statement about the -pierceable sets is not valid for general convex sets. Danzer and Grünbaum proved the first and one of the most important Helly type results on multi-pierceable families; viz. famlies of axis parallel boxes.
One important generalization of Helly's theorem is Colorful Helly's Theorem. In this talk, we shall prove a colorful version of Danzer and Grünbaum's -pierceability result for families of axis parallel boxes. This work was jointly done with Sourav Chakraborty and Arijit Ghosh.