Strong bunk bed connectivity criterion
Statement
Let be a graph, let be a specified collection of vertices with outside edges, and let and be the vertices considered in the bunk bed conjecture. Let denote the subgraph induced by removing the vertices in . Strong bunk bed criterion. The graph satisfies the bunk bed conjecture strongly if and only if there is a path from to in .
This is a proposed characterization of when the comparison in the bunk bed conjecture is strict. The source gives a proof framework involving path shadows and conditional connection probabilities, but does not state that the criterion is independently established beyond that discussion.
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.