Path separation by short cycles
classification
🧮 math.CO
keywords
cyclepathsfamilyhamiltonlengthseparatedasymptoticsbound
read the original 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.$
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.