ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a kk-connected graph, and let C1C_1 and C2C_2 be any two longest cycles of GG.

Scott Smith's conjecture. The cycles C1C_1 and C2C_2 intersect in at least kk vertices:

∣V(C1)∩V(C2)∣≥k.|V(C_1) \cap V(C_2)| \geq k.

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 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.