Path separation by short cycles
Preprint
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
All Related Versions
This publication has 5 references indexed in Scilit:
- Families of locally separated Hamilton pathsJournal of Graph Theory, 2017
- Maximum Size of Reverse-Free Sets of PermutationsSIAM Journal on Discrete Mathematics, 2013
- Triangle-intersecting families of graphsJournal of the European Mathematical Society, 2012
- Families of Graph-different Hamilton PathsSIAM Journal on Discrete Mathematics, 2012
- On Reverse-Free Codes and PermutationsSIAM Journal on Discrete Mathematics, 2010