Families of locally separated Hamilton paths
JOURNAL OF GRAPH THEORY(2018)
摘要
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 maximum 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.
更多查看译文
关键词
graph-difference,Hamilton paths,intersection problems,permutations
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要