Kasteleyn's Bunkbed Conjecture for Bernoulli bond percolation
Statement
Let be an undirected graph, and let and be two copies of . For each , write and for its copies, and form the bunkbed graph by adding bidirected vertical edges between and for every . Under -Bernoulli bond percolation, let denote the event that the percolated bunkbed graph contains a path connecting and . Kasteleyn's Bunkbed Conjecture. For every undirected graph and every ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.