连通图中任意三条最长路有一个公共顶点
组合数学
2024-05-07 v3
摘要
1995年英国组合会议提出了一个问题：连通图中任意三条最长路是否有一个公共顶点？本文证明了该问题的答案是肯定的。
引用
@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}
}
备注
The paper is erroneous, and poorly written