Path separation by short cycles

2015/01/05 by Gérard Cohen, Cohen, Gérard, Emanuela Fachini +3 · 1 citation
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.1501.00813

final version with corrections

arxiv created 2016/05/04 · arxiv updated 2016/05/05

Abstract

Two Hamilton paths in K_n are separated by a cycle of length k if their union contains such a cycle. For small fixed values of k we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in K_n such that any pair of paths in the family is separated by a cycle of length k.

Cited by

• New constructions and bounds for nonabelian Sidon sets with applications to Turán-type problems

Related

• Hamilton paths with lasting separation
• Families of graph-different Hamilton paths
• Families of locally separated Hamilton paths
• Improved upper bounds on even-cycle creating Hamilton paths
• On Relative Length of Long Paths and Cycles in Graphs