2000 character limit reached
Hamilton decompositions of one-ended Cayley graphs
Published 27 Sep 2017 in math.CO | (1709.09463v1)
Abstract: We prove that any one-ended, locally finite Cayley graph with non-torsion generators admits a decomposition into edge-disjoint Hamiltonian (i.e. spanning) double-rays. In particular, the $n$-dimensional grid $\mathbb{Z}n$ admits a decomposition into $n$ edge-disjoint Hamiltonian double-rays for all $n \in \mathbb{N}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.