持久分离Hamilton路
Hamilton paths with lasting separation
摘要：
在点集为[n]的完全图中，当任意两条路都有一条长为k的子路完全包含在其中一条路中且边{1}与另一条路不相交时，我们确定了Hamilton路集的最大基数的渐近性.
英文摘要：
We determine the asymptotics of the largest cardinality of a set of Hamilton paths in the complete graph with vertex set [n] under the condition that for any two of the paths in the family there is a subpath of length k entirely contained in only one of them and edge{disjoint from the other one.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
