Problem

Source: Iran 3rd round 2011-combinatorics exam-p1

Tags: combinatorics proposed, combinatorics



prove that if graph $G$ is a tree, then there is a vertex that is common between all of the longest paths. proposed by Sina Rezayi