The Hamilton compression of highly symmetric graphs

<jats:p>We say that a Hamilton cycle <jats:inline-formula><jats:alternatives><jats:tex-math>$$C=(x_1,\ldots ,x_n)$$</jats:tex-math><mml:math xmlns:mml="http://www.w3. org/1998/Math/MathML"> <mml:mrow> <mml:mi>C</mml:mi> <mml:mo>=</mml:mo> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mo>…</mml:mo> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> </mml:math></jats:alternatives></jats:inline-formula> in a graph <jats:italic>G</jats:italic> is <jats:italic>k</jats:italic>-symmetric, if the mapping <jats:inline-formula><jats:alternatives><jats:tex-math>$$x_i\mapsto x_{i+n/k}$$</jats:tex-math><mml:math xmlns:mml="http://www.w3. org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>x</mml:mi> <mml:mi>i</mml:mi> </mml:msub> <mml:mo>↦</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mrow> <mml:mi>i</mml:mi> <mml:mo>+</mml:mo> <mml:mi>n</mml:mi> <mml:mo>/</mml:mo> <mml:mi>k</mml:mi> </mml:mrow> </mml:msub> </mml:mrow> </mml:math></jats:alternatives></jats:inline-formula> for all <jats:inline-formula><jats:alternatives><jats:tex-math>$$i=1,\ldots ,n$$</jats:tex-math><mml:math xmlns:mml="http://www.w3. org/1998/Math/MathML"> <mml:mrow> <mml:mi>i</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mo>…</mml:mo> <mml:mo>,</mml:mo> <mml:mi>n</mml:mi> </mml:mrow> </mml:math></jats:alternatives></jats:inline-formula>, where indices are considered modulo <jats:italic>n</jats:italic>, is an automorphism of <jats:italic>G</jats:italic>. In other words, if we lay out the vertices <jats:inline-formula><jats:alternatives><jats:tex-math>$$x_1,\ldots ,x_n$$</jats:tex-math><mml:math xmlns:mml="http://www.w3. org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>x</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mo>…</mml:mo> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mi>n</mml:mi> </mml:msub> </mml:mrow> </mml:math></jats:alternatives></jats:inline-formula> equidistantly on a circle and draw the edges of <jats:italic>G</jats:italic> as straight lines, then the drawing of <jats:italic>G</jats:italic> has <jats:italic>k</jats:italic>-fold rotational symmetry, i.e., all information about the graph is compressed into a <jats:inline-formula><jats:alternatives><jats:tex-math>$$360^\circ /k$$</jats:tex-math><mml:math xmlns:mml="http://www.w3. org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mn>360</mml:mn> <mml:mo>∘</mml:mo> </mml:msup> <mml:mo>/</mml:mo> <mml:mi>k</mml:mi> </mml:mrow> </mml:math></jats:alternatives></jats:inline-formula> wedge of the drawing. The maximum <jats:italic>k</jats:italic> for which there exists a <jats:italic>k</jats:italic>-symmetric Hamilton cycle in <jats:italic>G</jats:italic> is referred to as the <jats:italic>Hamilton compression of</jats:italic> <jats:italic>G</jats:italic>. We investigate the Hamilton compression of four different families of vertex-transitive graphs, namely hypercubes, Johnson graphs, permutahedra and Cayley graphs of abelian groups. In several cases, we determine their Hamilton compression exactly, and in other cases, we provide close lower and upper bounds. The constructed cycles have a much higher compression than several classical Gray codes known from the literature. Our constructions also yield Gray codes for bitstrings, combinations and permutations that have few tracks and/or that are balanced. </jats:p>