The Hadwiger-Debrunner number is the least integer
such that every finite family of at least
nonempty compact convex
sets in
with the
-property
can be met by at most
points. The
-property means that among every
members of the family, some
have a common point. For
, this number is finite by the
-theorem of Alon and Kleitman (1992), which generalizes
Helly's theorem.
For fixed integers , Chen et al. (2026) proved
as , where
denotes little-O notation.
In particular, the planar bound for
is
.
Their complementary constructions also give
for fixed
, where
is the floor function.
Other parameter ranges benefit from different constructions. For fixed integers , they obtain
. For fixed
, they obtain
. Chen et al. (2026)
credit GPT-6 Astra with assisting the proof of their linear-reduction
theorem and the quantitative optimization.