Path separation by short cycles

Gérard Cohen; Emanuela Fachini; János Körner

Path separation by short cycles

Combinatorics 2016-05-05 v2

Authors: Gérard Cohen , Emanuela Fachini , János Körner

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.$

Keywords

dyck paths

Cite

@article{arxiv.1501.00813,
  title  = {Path separation by short cycles},
  author = {Gérard Cohen and Emanuela Fachini and János Körner},
  journal= {arXiv preprint arXiv:1501.00813},
  year   = {2016}
}

Comments

final version with corrections

Related papers

View all related →