TITLE: Make every Hamiltonian cycle have the same length
QUESTION [6 upvotes]: Suppose we have a complete graph with 13 vertices. Can we assign a different positive integer length to each edge such that all Hamiltonian circuits in the graph are equal in length, which is exactly 2017.

REPLY [6 votes]: Let $a_1=1$ and $a_2=3;$ let $a_n=a_{n-1}+a_{n-2}+1$ for $3\le n\le12;$ and let $a_{13}=a_{12}+a_{11}+61.$ Thus we get the $13$ numbers
$$1,\ 3,\ 5,\ 9,\ 15,\ 25,\ 41,\ 67,\ 109,\ 177,\ 287,\ 465,\ 813.$$
Observe that these are odd numbers, their $\binom{13}2$ pairwise sums are distinct, and they add up to $2017.$ Assign these $13$ numbers to the vertices of the complete graph, and assign to each edge the average of the numbers assigned to its endpoints.