Username: smh Email: N/A Reputation: 8
smh commented on Some works on Zamfirescu's Conjecture: In a connected graph the intersection of any three distinct longest paths is nonempty. posted by smh 3 weeks ago · a/graphtheory
smh · 3 weeks ago

If the two paths didn't share a vertex then you could construct a new path using the two longest paths (since the graph is connected) that is longer than the longest paths, resulting in a contradiction.