A conjecture attributed to Smith states that every pair of longest cycles in a $k$-connected graph intersect each other in at least $k$ vertices. In this paper, we show that every pair of longest cycles in a~$k$-connected graph on $n$ vertices intersect each other in at least~$\min\{n,8k-n-16\}$ vertices, which confirms Smith's conjecture when $k\geq (n+16)/7$. An analog conjecture for paths instead of cycles was stated by Hippchen. By a simple reduction, we relate both conjectures, showing that Hippchen's conjecture is valid when either $k \leq 6$ or $k \geq (n+9)/7$.

翻译：暂无翻译