完全二部图及相关图类的上下铺猜想
Bunkbed conjecture for complete bipartite graphs and related classes of graphs
AI总结:
本文针对上下铺猜想(独立边渗流中同层顶点连通概率高于跨层),在已有完全图证明的基础上,进一步证明其对完全二部图、去完全子图边的完全图及对称完全k部图成立。
摘要:
设$G=(V,E)$为有限简单图,对应的上下铺图$G^\text{pm}$由$G$的两个副本$G^+=(V^+,E^+)$、$G^-=(V^-,E^-)$,以及连接顶点$v\in V$的两个副本$v_+\in V_+$与$v_-\in V_-$的额外边构成。上下铺猜想指出,在$G^\text{pm}$的独立边渗流中,对任意$v,w\in V$,$v_-$与$w_-$连通的概率高于$v_-$与$w_+$连通的概率。该猜想看似合理,但目前严格证明的结果极少,近期仅在完全图上得到证明。本文证明了该猜想对完全二部图、去掉完全子图边集的完全图,以及对称完全$k$部图均成立。
英文摘要:
Let $G = (V,E)$ be a simple finite graph. The corresponding bunkbed graph $G^\pm$ consists of two copies $G^+ = (V^+,E^+),G^- = (V^-,E^-)$ of $G$ and additional edges connecting any two vertices $v_+ \in V_+,v_- \in V_-$ that are the copies of a vertex $v \in V$. The bunkbed conjecture states that for independent bond percolation on $G^\pm$, for all $v,w \in V$, it is more likely for $v_-,w_-$ to be connected than for $v_-,w_+$ to be connected. While this seems very plausible, so far surprisingly little is known rigorously. Recently the conjecture has been proved for complete graphs. Here we give a proof for complete bipartite graphs, complete graphs minus the edges of a complete subgraph, and symmetric complete $k$-partite graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。