ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be an undirected graph, and let (V−,E−)(V^-,E^-) and (V+,E+)(V^+,E^+) be two copies of GG. For each v∈Vv\in V, write v−v^- and v+v^+ for its copies, and form the bunkbed graph by adding bidirected vertical edges between v−v^- and v+v^+ for every v∈Vv\in V. Under pp-Bernoulli bond percolation, let x↔yx\leftrightarrow y denote the event that the percolated bunkbed graph contains a path connecting xx and yy. Kasteleyn's Bunkbed Conjecture. For every undirected graph G=(V,E)G=(V,E) and every u,v∈Vu,v\in V,

Pp(u−↔v−)≥Pp(u−↔v+).\mathbb{P}_p(u^-\leftrightarrow v^-) \geq \mathbb{P}_p(u^-\leftrightarrow v^+).

The conjecture asserts that the two vertices on the same floor should be at least as likely to be connected as vertices on opposite floors. It was disproved by Gladkov, Pak and Zimin, whose counterexample was based on a graph found by Hollom.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.