Longest cycles intersect linearly in highly connected graphs

A longstanding conjecture attributed to Smith (1984) asserts that for every $k\ge 2$, any two longest cycles in a $k$-connected graph share at least $k$ vertices. In this paper, we prove the first linear lower bound, showing that any two longest cycles in a $k$-connected graph share at least $k\mathrm{/}600$ vertices. Departing from previous Turán-type extremal arguments, we develop a novel structural approach that also yields applications to related problems on longest cycles and paths.