A new proof of the bunkbed conjecture in the $p\uparrow 1$ limit

Lawrence Hollom

For a finite simple graph $G$, the bunkbed graph $G^{\pm }$ is defined to be the product graph $G\square K_2$. We will label the two copies of a vertex $v\in V(G)$ as $v_{-}$ and $v_{+}$.…