The quadratic diameter conjecture for friends-and-strangers graphs on cycles
Statement
Let be a graph on vertices, and let denote its friends-and-strangers graph. The quadratic diameter conjecture asserts that the maximum diameter of a connected component of
is . This would sharpen the paper's polynomial diameter bound for cycles; the conjecture is presented as an unresolved improvement, and would imply an 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.