English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $G=(V,E)$ be a countable graph. The Bunkbed graph of $G$ is the productgraph $G \times K_2$, which has vertex set $V\times \{0,1\}$ with "horizontal''edges inherited from $G$ and additional "vertical'' edges connecting $(w,0)$and $(w,1)$ for each $w \in V$. Kasteleyn's bunkbed conjecture states that foreach $u,v \in V$ and $p\in [0,1]$, the vertex $(u,0)$ is at least as likely tobe connected to $(v,0)$ as to $(v,1)$ under Bernoulli-$p$ bond percolation onthe bunkbed graph. We prove that the conjecture holds in the $p \uparrow 1$limit in the sense that for each finite graph $G$ there exists$\varepsilon(G)>0$ such that the bunkbed conjecture holds for $p \geqslant1-\varepsilon(G)$.

The bunkbed conjecture holds in the $p\uparrow 1$ limit