Hamilton paths with lasting separation
Combinatorics
2017-07-19 v2
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.
Keywords
Cite
@article{arxiv.1701.07752,
title = {Hamilton paths with lasting separation},
author = {Janos Korner and Emanuela Fachini},
journal= {arXiv preprint arXiv:1701.07752},
year = {2017}
}