The bunkbed conjecture for graph percolation
Statement
Let be a graph, and let be its bunkbed graph with two layers, whose corresponding vertices are denoted and for . Let
be a symmetric weight on , and write for the probability that and are connected after independently retaining each edge according to its weight. Bunkbed conjecture. For every ,
The conjecture asserts that, under symmetric edge percolation, vertices in the same layer are at least as likely to be connected as vertices in opposite layers. The paper proves that the conjecture is preserved when graphs are glued along a vertex, with forests as an immediate consequence; explicit proven families include complete graphs, complete bipartite graphs, and complete graphs minus one edge.
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.