Families of Graph-different Hamilton Paths
Families of Graph-different Hamilton Paths
Let $\mathbb{D}\subseteq \mathbb{N}$ be an arbitrary subset of the natural numbers. For every n, let $M(n, \mathbb{D})$ be the maximum of the cardinality of a set of Hamiltonian paths in the complete graph $K_n$ such that the union of any two paths from the family contains a not necessarily induced …