Zamfirescu's three-longest-path conjecture
Statement
Let a longest path of a connected graph be a path of maximum length. Zamfirescu's conjecture. For every connected graph, any of its longest paths have a common vertex. This is an open case of Gallai's question about common vertices of longest paths; the paper gives upper bounds on the distance among longest paths but does not resolve the common-vertex assertion.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.