2017/01/26 by Janos Korner, Korner, Janos, Emanuela Fachini +1
Mathematics · #05C35 #05C62 #05D99 #94A24 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C35 #msc:05C62 #msc:05D99 #msc:94A24
paper · pdf · doi:10.48550/arxiv.1701.07752
arxiv created 2017/07/18 · arxiv updated 2017/07/19
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 edgedisjoint from the other one.