MathDB
every three longest paths have a common vertex

Source:

February 4, 2011
combinatorics unsolvedcombinatorics

Problem Statement

prove or disprove: in a connected graph GG, every three longest paths have a vertex in common.
Back to ProblemsView on AoPS