Families of locally separated Hamilton paths
Combinatorics
2015-05-05 v2 Information Theory
math.IT
Abstract
We improve by an exponential factor the lower bound of Korner and Muzi for the cardinality of the largest family of Hamilton paths in a complete graph of n vertices in which the union of any two paths has degree 4. The improvement is through an explicit construction while the previous bound was obtained by a greedy algorithm. We solve a similar problem for permutations up to an exponential factor.
Keywords
Cite
@article{arxiv.1411.3902,
title = {Families of locally separated Hamilton paths},
author = {Janos Korner and Angelo Monti},
journal= {arXiv preprint arXiv:1411.3902},
year = {2015}
}
Comments
In this version an error in the previous manuscript is corrected