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

关于$k$ -无交叉族的规模

On the size of $k$-cross-free families

Andrey Kupavskii, János Pach, István Tomon

摘要:

如果四个集合$A\cap B$、$A\setminus B$、$B\setminus A$和$X\setminus(A\cup B)$中没有一个是空的,则称$n$ -元素基集合$X$的两个子集$A,B$是\emph{crossing}. Karzanov和Lomonosov在40年前提出,如果$X$的子集的家族$\mathcal{F}$不包含$k$成对杂交元件,则$|\mathcal{F}|=O_{k}(n)$。对于$k=2$和$3$,这个猜想是正确的,但是对于更大的$k$值,由于罗蒙诺索夫,最好的已知上限是$|\mathcal{F}|=O_{k}(n\log n)$。在本文中,我们通过证明$|\mathcal{F}|=O_{k}(n\log^{*} n)$成立来改进这个界,其中$\log^{*}$表示重对数函数。

英文摘要:

Two subsets $A,B$ of an $n$-element ground set $X$ are said to be \emph{crossing}, if none of the four sets $A\cap B$, $A\setminus B$, $B\setminus A$ and $X\setminus(A\cup B)$ are empty. It was conjectured by Karzanov and Lomonosov forty years ago that if a family $\mathcal{F}$ of subsets of $X$ does not contain $k$ pairwise crossing elements, then $|\mathcal{F}|=O_{k}(n)$. For $k=2$ and $3$, the conjecture is true, but for larger values of $k$ the best known upper bound, due to Lomonosov, is $|\mathcal{F}|=O_{k}(n\log n)$. In this paper, we improve this bound by showing that $|\mathcal{F}|=O_{k}(n\log^{*} n)$ holds, where $\log^{*}$ denotes the iterated logarithm function.

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

↑