Paperlane

no. 16 · Tuesday 17 November 2026

Hadwiger-Debrunner numbers from rainbow Turán numbers and beyond

Wenchong Chen, Gennian Ge and Yang Shu

math.CO · 22 pp

Abstract

The Hadwiger-Debrunner number $\operatorname{HD}_d(p,q)$ is defined as the maximum piercing number over all finite families of compact convex sets in $\mathbb R^d$ in which among every $p$ sets, some $q$ have non-empty intersection. We develop three complementary constructions that improve lower bounds for Hadwiger-Debrunner numbers. For any fixed $q>d\ge 2$, a randomly sparsified family of hyperplanes, analyzed using hypergraph containers, yields $\operatorname{HD}_d(p,q)\ge p^{(d+q-2)/(q-1)+o(1)}$ as $p\rightarrow\infty$. To deduce further bounds, we establish a transfer argument from upper bounds on the sizes of sufficiently general-positioned subsets of high-dimensional integer grids to lower bounds for Hadwiger-Debrunner numbers. Two methodologies are adopted to derive the former: one connects rainbow Turán theory and general-positioned grid sets, and the other uses full spark linear reduction of tuples with bounded-size preimages. As a combinatorial ingredient, we describe the rainbow Turán behavior under suspension operations, which may be of independent interest.

comments
22 pages
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2611.19281 ↗