The hypergraph Bunkbed conjecture
Statement
Let be a finite graph, let , and let be a partition of into connected subgraphs. In the model , all edges in each receive the same color, red or blue, independently and with equal probability; a walk may change color only at a vertex in .
Hypergraph Bunkbed conjecture. For every ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.