WorksMathematics
Hadwiger-Debrunner numbers from rainbow Turán numbers and beyond
Abstract
The Hadwiger-Debrunner number is defined as the maximum piercing number over all finite families of compact convex sets in in which among every sets, some have non-empty intersection. We develop three complementary constructions that improve lower bounds for Hadwiger-Debrunner numbers. For any fixed , a randomly sparsified family of hyperplanes, analyzed using hypergraph containers, yields as . 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.