Papers
Topics
Authors
Recent
Search
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}$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.