The transition conjecture for unicyclic graphs
Statement
Let and be unicyclic graphs with the same degree sequence. A 2-switch is an edge-switching operation on a graph. Transition conjecture. There is a sequence of 2-switches transforming into such that every intermediate graph is also unicyclic. This conjecture asks whether the space of unicyclic graphs with a fixed degree sequence is connected under 2-switches; the source presents this as an interesting case where a transition theorem may exist, without giving a resolution.
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.