ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let XX be a specified collection of vertices with outside edges, and let ss and ff be the vertices considered in the bunk bed conjecture. Let G−XG-X denote the subgraph induced by removing the vertices in XX. Strong bunk bed criterion. The graph satisfies the bunk bed conjecture strongly if and only if there is a path from ss to ff in G−XG-X.

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