  A question was raised in 1995 at the British Combinatorial Conference: Do any
three longest paths in a connected graph have a vertex in common? In this
paper, it is shown that the answer to that question is yes.
