New Helly-type results for discrete boxes: Quantitative colorful and -variants
arXiv:2509.13115
Abstract
In 2008, Halman showed that for any finite set and any finite family of axis-parallel boxes in , if the intersection of and any subfamily of size at most is non-empty, then the intersection of and is also non-empty. Very recently Edwards and Soberón initiated the study of quantitative colorful version for families, -type variation for , and other extensions of this Helly-type result by Halman. In this paper, we study the quantitative colorful Halman problem for families as well its -type variation for . Specifically, our main result asserts that for any finite set and finite families of boxes in , where , if every transversal for the families has an intersection containing at least points of , then there exist and a subset of of size at most \[ 2n+\Big\lfloor \frac{n-1}{d \cdot 2^{d-1}} \Big\rfloor, \] such that each box of contains at least points of this subset.