由动态点集和无底矩形诱导的着色超图
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
摘要:
我们考虑动态一维点集上的着色问题:点在给定时间出现和消失在一条直线上。我们希望用k种颜色给它们着色,使得在任何时候,对于某个函数p,任何p(k)个连续点的序列至少包含每种颜色的一个点。我们证明了一般情况下不存在这样的函数p(k)。然而,在有限的情况下,点逐渐出现,但永远不会消失,我们给出了一个着色算法,保证在任何时候的性质,p(k)= 3 k-2。这可以解释为在R^2中用k种颜色着色点集,使得任何包含至少3 k-2个点的无底矩形至少包含每种颜色的一个点。在这里,无底矩形是一个轴对齐的矩形,其底边低于集合的最低点。对于这个问题,我们还证明了一个下界p(k)>ck,其中c>1.67。因此,对于每个k,存在一个点集,其每个k-着色使得存在一个包含ck个点的无底矩形,并且至少缺少k种颜色中的一种。Chen等人(2009)证明了在一般轴对齐矩形的情况下不存在这样的函数$p(k)$。我们的结果也补充了Keszegh和Palvolgyi最近关于八分体覆盖可分解性的结果(2011,2012)。
英文摘要:
We consider a coloring problem on dynamic, one-dimensional point sets: points appearing and disappearing on a line at given times. We wish to color them with k colors so that at any time, any sequence of p(k) consecutive points, for some function p, contains at least one point of each color. We prove that no such function p(k) exists in general. However, in the restricted case in which points appear gradually, but never disappear, we give a coloring algorithm guaranteeing the property at any time with p(k)=3k-2. This can be interpreted as coloring point sets in R^2 with k colors such that any bottomless rectangle containing at least 3k-2 points contains at least one point of each color. Here a bottomless rectangle is an axis-aligned rectangle whose bottom edge is below the lowest point of the set. For this problem, we also prove a lower bound p(k)>ck, where c>1.67. Hence for every k there exists a point set, every k-coloring of which is such that there exists a bottomless rectangle containing ck points and missing at least one of the k colors. Chen et al. (2009) proved that no such function $p(k)$ exists in the case of general axis-aligned rectangles. Our result also complements recent results from Keszegh and Palvolgyi on cover-decomposability of octants (2011, 2012).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。