ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let YY be a graph on n≥2k≥4n\ge 2k\ge 4 vertices. A kk-bridge is a set of kk edges whose deletion disconnects the graph, and it is non-trivial when neither resulting component is an isolated vertex. The graph FS(Kk,n−k,Y)\mathsf{FS}(K_{k,n-k},Y) is the friends-and-strangers graph associated with the graphs Kk,n−kK_{k,n-k} and YY. Connectedness conjecture. The graph FS(Kk,n−k,Y)\mathsf{FS}(K_{k,n-k},Y) is connected if and only if YY is a connected non-bipartite graph without a non-trivial kk-bridge and Y≠CnY\not=C_n. This conjecture extends the established disconnectedness criterion, while the cited theorems provide only weaker sufficient conditions for connectedness; the full characterization remains open.

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.