Absolute differences along Hamiltonian paths
Summary: We prove that if the vertices of a complete graph are labeled with the elements of an arithmetic progression, then for any given vertex there is a Hamiltonian path starting at this vertex such that the absolute values of the differences of consecutive vertices along the path are pairwise distinct. In another extreme case where the label set has small additive energy, we show that the graph actually possesses a Hamiltonian cycle with the property just mentioned. These results partially solve a conjecture by \textit{Z.-W. Sun} [``Some new problems in additive combinatorics, Preprint, \url{arXiv:1309.1679}].
- Hamiltonian paths in distance graphs
- On Hamiltonian paths in distance graphs
- On mutually independent Hamiltonian paths
- Hamiltonian square-paths
- scientific article; zbMATH DE number 438460
- Hamiltonian paths in infinite graphs
- On Hamiltonian paths and a chain metric
- On Hamiltonian alternating cycles and paths
- Sums and differences along Hamiltonian cycles
- Sums and differences along Hamiltonian cycles
- New methods to attack the Buratti-Horak-Rosa conjecture
- scientific article; zbMATH DE number 6850346 (Why is no real title available?)
- scientific article; zbMATH DE number 2159648 (Why is no real title available?)
- Growable realizations: a powerful approach to the Buratti-Horak-Rosa conjecture
- Sums and differences along Hamiltonian cycles
- Sums and differences along Hamiltonian cycles
- On unitary/strong linear realizations: Buratti-Horak-Rosa conjecture
This page was built for publication: Absolute differences along Hamiltonian paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490402)