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

Bollobás和Leader的两个有向路图的证明

The proofs of two directed paths conjectures of Bollobás and Leader

Trevor Pinto

摘要:

令$A$和$B$是$n$维超立方体$Q_n$的顶点的大小为$2^k$的不相交集合。1997年,Bollobás和Leader证明了在这样的$A$和$B$之间一定存在$(n-k)2^k$边不相交的路。他们指出,当$A$是下集,而$B$是上集时,这些路径可以选择为有向的(即路径中的顶点形成链)。我们使用一种新的类型的压缩参数来证明这些构造的更强的版本,即最大数量的边不相交的路径之间的向下设置的$A$和向上设置的$B$是相同的最大数量的有向边不相交的路径之间的$A$和$B$。Bollobás和领导人提出了一个类似的猜想顶点不相交的道路,我们证明了加强这一类似的方法。我们也证明了类似的结果,所有其他大小的$A$和$B$。

英文摘要:

Let $A$ and $B$ be disjoint sets, of size $2^k$, of vertices of $Q_n$, the $n$-dimensional hypercube. In 1997, Bollobás and Leader proved that there must be $(n-k)2^k$ edge-disjoint paths between such $A$ and $B$. They conjectured that when $A$ is a down-set and $B$ is an up-set, these paths may be chosen to be directed (that is, the vertices in the path form a chain). We use a novel type of compression argument to prove stronger versions of these conjectures, namely that the largest number of edge-disjoint paths between a down-set $A$ and an up-set $B$ is the same as the largest number of directed edge-disjoint paths between $A$ and $B$. Bollobás and Leader made an analogous conjecture for vertex-disjoint paths and we prove a strengthening of this by similar methods. We also prove similar results for all other sizes of $A$ and $B$.

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

↑