MathDB

7

Part of 2011 Pre-Preparation Course Examination

Problems(1)

every three longest paths have a common vertex

Source:

2/4/2011
prove or disprove: in a connected graph GG, every three longest paths have a vertex in common.
combinatorics unsolvedcombinatorics