arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1812.08396math.CO
收藏

二维离散盒子的划分

On Partitions of Two-Dimensional Discrete Boxes

Eyal Ackerman, Rom Pinchasi

AI总结:

本文证明二维离散盒子具有$(k,\ell)$-穿透性质的划分至少需要$(k-1)+(\ell-1)+\lceil 2\sqrt{(k-1)(\ell-1)}\rceil$个子盒子,该界近乎最优,并推论到红蓝边染色图中的团覆盖问题。

摘要:

设 $A$ 和 $B$ 为有限集合,考虑将离散盒子 $A \times B$ 划分为形如 $A' \times B'$ 的子盒子,其中 $A' \subset A$ 且 $B' \subset B$。对于正整数 $k$ 和 $ell$,如果每条形如 $\{a\} \times B$ 的直线至少与 $k$ 个子盒子相交,且每条形如 $A \times \{b\}$ 的直线至少与 $ell$ 个子盒子相交,则称这样的划分具有 $(k,\ell)$-穿透性质。我们证明,具有 $(k, \ell)$-穿透性质的 $A \times B$ 的划分必须至少包含 $(k-1)+(\ell-1)+\left\lceil 2\sqrt{(k-1)(\ell-1)} \right\rceil$ 个子盒子。对于每个 $k$ 和 $\ell$,这个界是近乎最优的(至多相差一个加法单位)。作为推论,我们得到相同的界也适用于一个图的最小顶点数,该图的边可以被染成红色和蓝色,使得每个顶点都参与一个红色 $k$-团和一个蓝色 $\ell$-团。

英文摘要:

Let $A$ and $B$ be finite sets and consider a partition of the \emph{discrete box} $A \times B$ into \emph{sub-boxes} of the form $A' \times B'$ where $A' \subset A$ and $B' \subset B$. We say that such a partition has the $(k,\ell)$-piercing property for positive integers $k$ and $\ell$ if every \emph{line} of the form $\{a\} \times B$ intersects at least $k$ sub-boxes and every line of the form $A \times \{b\}$ intersects at least $\ell$ sub-boxes. We show that a partition of $A \times B$ that has the $(k, \ell)$-piercing property must consist of at least $(k-1)+(\ell-1)+\left\lceil 2\sqrt{(k-1)(\ell-1)} \right\rceil$ sub-boxes. This bound is nearly sharp (up to one additive unit) for every $k$ and $\ell$. As a corollary we get that the same bound holds for the minimum number of vertices of a graph whose edges can be colored red and blue such that every vertex is part of red $k$-clique and a blue $\ell$-clique.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑