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

平面凸集上的Petruska问题

Petruska's question on planar convex sets

Adam S. Jobson, André E. Kézdy, Jenő Lehel, Timothy J. Pervenecki, Géza Tóth

摘要:

给定$R^2$中的$2k-1$凸集,使得平面上没有一点被多于$k$的集合覆盖,是否真的有两个凸集的并集包含平面上所有$k$覆盖的点?这个问题是由于Gy。Petruska对$k=1,2,3$有一个明显的肯定回答;我们在这里证明了这个断言对$k=4$也是正确的,并且我们给出了$k=5$的一个反例。我们解释如何Petruska的几何问题适合于经典的超图极值问题,称为箭头问题,提出的P. Erdensys。

英文摘要:

Given $2k-1$ convex sets in $R^2$ such that no point of the plane is covered by more than $k$ of the sets, is it true that there are two among the convex sets whose union contains all $k$-covered points of the plane? This question due to Gy. Petruska has an obvious affirmative answer for $k=1,2,3$; we show here that the claim is also true for $k=4$, and we present a counterexample for $k=5$. We explain how Petruska's geometry question fits into the classical hypergraph extremal problems, called arrow problems, proposed by P. Erdős.

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

↑