arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.16245math.CO
收藏

连通图中任意三条最长路径都有一个公共顶点

Any Three Longest Paths In A Connected Graph Has A Common Vertex

Nirankush Sarkar

AI总结:

本文解决了1995年英国组合数学会议提出的问题,证明了连通图中任意三条最长路径必有一个公共顶点。

摘要:

1995年英国组合数学会议提出了一个问题:连通图中任意三条最长路径是否都有一个公共顶点?本文证明了该问题的答案是肯定的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑