Hamilton paths with lasting separation
classification
🧮 math.CO
keywords
pathshamiltonasymptoticscardinalitycompleteconditioncontaineddetermine
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.