ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let BB(G)BB(G) be its bunkbed graph with two layers, whose corresponding vertices are denoted x−x^- and x+x^+ for xobreak in obreakV(G)x obreak\text{ in } obreak V(G). Let

μ ⁣:E(BB(G))→[0,1]\mu \colon E(BB(G)) \to [0,1]

be a symmetric weight on BB(G)BB(G), and write PBB(G),μ(u∼v)\mathbb{P}_{BB(G),\mu}(u\sim v) for the probability that uu and vv are connected after independently retaining each edge according to its weight. Bunkbed conjecture. For every x,y∈V(G)x,y\in V(G),

PBB(G),μ(x−∼y−)≥PBB(G),μ(x−∼y+).\mathbb{P}_{BB(G),\mu}(x^-\sim y^-)\geq \mathbb{P}_{BB(G),\mu}(x^-\sim y^+).

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 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.