
























We prove a colorful extension of a Helly-type theorem by Danzer and Grünbaum (Combinatorica, 1982) concerning two-piercing families of axis-parallel boxes in $\mathbb{R}^d$. We also show that our result is tight by constructing extremal families that achieve the bound. Related work includes a graph-theoretic proof of the original theorem by Pendavingh, Puite, and Woeginger (Discrete Applied Mathematics, 2008), and a two-piercing result for lower-dimensional boxes by Baños and Oliveros (Acta Mathematica Hungarica, 2018).
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。