ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let YY be a graph on nn vertices, and let FS(Cyclen,Y)\mathsf{FS}(\textsf{Cycle}_n,Y) denote its friends-and-strangers graph. The quadratic diameter conjecture asserts that the maximum diameter of a connected component of

FS(Cyclen,Y)\mathsf{FS}(\textsf{Cycle}_n,Y)

is O(n2)O(n^2). This would sharpen the paper's polynomial diameter bound for cycles; the conjecture is presented as an unresolved improvement, and would imply an O(n3)O(n^3) bound for the corresponding double-flip distances.

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.