ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a finite graph, let T⊆V(G)T\subseteq V(G), and let U={U1,…,Uk}\mathcal U=\{U_1,\ldots,U_k\} be a partition of EE into connected subgraphs. In the model E4T,U(G)E_4^{T,\mathcal U}(G), all edges in each UiU_i receive the same color, red or blue, independently and with equal probability; a walk may change color only at a vertex in TT.

Hypergraph Bunkbed conjecture. For every u,v∈V(G)u,v\in V(G),

P(u0⟷v0)≥P(u0⟷v1).P(u_0\longleftrightarrow v_0)\ge P(u_0\longleftrightarrow v_1).

This generalizes the two-color model by allowing connected groups of edges to share a color, and is needed for the paper's outerplanar-graph argument. The assertion is not established in general.

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.