arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.05507math.CO
收藏

不平衡 Zarankiewicz 数的精确值

Exact values for unbalanced Zarankiewicz numbers

Guangzhou Chen, Daniel Horsley, Adam Mammoliti

AI总结:

针对 $n=\Theta(tm^2)$ 的不平衡 Zarankiewicz 数,本文结合线性超图与稠密图边分解,给出新上界族并确定大 $m$ 时几乎所有剩余情形的精确值。

摘要:

对于正整数 $s$、$t$、$m$ 和 $n$,Zarankiewicz 数 $Z_{s,t}(m,n)$ 被定义为:在两部分大小分别为 $m$ 和 $n$ 的二部图中,不包含这样的完全二部子图——其在大小为 $m$ 的部分中有 $s$ 个顶点、在大小为 $n$ 的部分中有 $t$ 个顶点——时所能具有的最大边数。一个简单论证表明,对于每个 $t\geq2$,当 $n\geq(t-1)\binom{m}{2}$ 时,$Z_{2,t}(m,n)=(t-1)\binom{m}{2}+n$。本文中,对于较大的 $m$,我们在 $n=\Theta(tm^2)$ 的几乎所有剩余情形中确定了 $Z_{2,t}(m,n)$ 的精确值。我们建立了一族新的 $Z_{2,t}(m,n)$ 上界,补充了 Roman 已得到的一族上界。随后我们证明,这些界中最优者的下取整几乎总能达到。我们还表明,存在该下取整无法达到的情形,而在另一些情形中,判断它是否能达到很可能是一个非常困难的问题。我们的结果是通过线性超图的视角审视该问题而证明的,构造则利用了关于稠密图边分解的已有结果。

英文摘要:

For positive integers $s$, $t$, $m$ and $n$, the Zarankiewicz number $Z_{s,t}(m,n)$ is defined to be the maximum number of edges in a bipartite graph with parts of sizes $m$ and $n$ that has no complete biparitite subgraph containing $s$ vertices in the part of size $m$ and $t$ vertices in the part of size $n$. A simple argument shows that, for each $t \geq 2$, $Z_{2,t}(m,n)=(t-1)\binom{m}{2}+n$ when $n \geq (t-1)\binom{m}{2}$. Here, for large $m$, we determine the exact value of $Z_{2,t}(m,n)$ in almost all of the remaining cases where $n=Θ(tm^2)$. We establish a new family of upper bounds on $Z_{2,t}(m,n)$ which complement a family already obtained by Roman. We then prove that the floor of the best of these bounds is almost always achieved. We also show that there are cases in which this floor cannot be achieved and others in which determining whether it is achieved is likely a very hard problem. Our results are proved by viewing the problem through the lens of linear hypergraphs and our constructions make use of existing results on edge decompositions of dense graphs.

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

↑