Any Three Longest Paths In A Connected Graph Has A Common Vertex
Combinatorics
2024-05-07 v3
Abstract
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.
Cite
@article{arxiv.2006.16245,
title = {Any Three Longest Paths In A Connected Graph Has A Common Vertex},
author = {Nirankush Sarkar},
journal= {arXiv preprint arXiv:2006.16245},
year = {2024}
}
Comments
The paper is erroneous, and poorly written