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

上下铺图上的最大流与自避行走

Maximum flow and self-avoiding walk on bunkbed graphs

Pengfei Tang

AI总结:

本文研究上下铺图上的最大流与自避行走,证明反射对称容量下同层最大流不小于跨层最大流,并证明完全图足够大时跨层自避行走更多,同时给出反例并提出割边条件下的待解问题。

摘要:

我们考虑上下铺图上的两个组合模型:最大流与自避行走。上下铺图定义为笛卡尔积 $G\times K_2$,其中 $G$ 是一个有限图,$K_2$ 是两个顶点(标记为 $0$ 和 $1$)上的完全图。对于最大流问题,我们证明:如果上下铺图 $G\times K_2$ 具有非负的、反射对称的边容量,那么对于任意 $u, v\in V(G)$,在 $G\times K_2$ 中从 $(u,0)$ 到 $(v,0)$ 的最大流强度至少与从 $(u,0)$ 到 $(v,1)$ 的最大流强度一样大。对于上下铺图 $G\times K_2$ 上的自避行走模型,我们研究从 $(u,0)$ 到 $(v,1)$ 的自避行走数量是否多于从 $(u,0)$ 到 $(v,0)$ 的自避行走数量。我们证明当 $G=K_n$ 是完全图且 $n$ 足够大时该结论成立。此外,我们给出该命题不成立的例子,并提出问题:当 $\{u,v\}$ 不是 $G$ 的割边时,该命题是否仍然成立。

英文摘要:

We consider two combinatorial models on bunkbed graphs: maximum flow and self-avoiding walks. A bunkbed graph is defined as the Cartesian product $G\times K_2$, where $G$ is a finite graph and $K_2$ is the complete graph on two vertices, labelled $0$ and $1$. For the maximum flow problem, we show that if the bunkbed graph $G\times K_2$ has non-negative, reflection-symmetric edge capacities, then for any $u, v\in V(G)$, the maximum flow strength from $(u,0)$ to $(v,0)$ in $G\times K_2$ is at least as large as that from $(u,0)$ to $(v,1)$. For the self-avoiding walk model on a bunkbed graph $G\times K_2$, we investigate whether there are more self-avoiding walks from $(u,0)$ to $(v,1)$ than from $(u,0)$ to $(v,0)$. We prove that this holds when $G=K_n$ is a complete graph and $n$ is sufficiently large. Additionally, we provide examples where the statement does not holds and pose the question of whether it remains true when $\{u,v\}$ is not a cut-edge of $G$.

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

↑