Scott Smith's longest-cycle intersection conjecture
Statement
Let be a -connected graph, and let and be any two longest cycles of .
Scott Smith's conjecture. The cycles and intersect in at least vertices:
This conjecture is presented as a potential application concerning intersections of longest cycles in highly connected graphs. The supplied text gives no resolution status.
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.