### Abstract

Original language | English |
---|---|

Journal | Journal of Combinatorial Theory / B |

Volume | 140 |

Publication status | Published - 2020 |

### Fingerprint

### Cite this

*Journal of Combinatorial Theory / B*,

*140*.

**Hamilton decompositions of one-ended Cayley graphs.** / Erde, Joshua; Pitz, Max; Lehner, Florian.

Research output: Contribution to journal › Article › Research › peer-review

*Journal of Combinatorial Theory / B*, vol. 140.

}

TY - JOUR

T1 - Hamilton decompositions of one-ended Cayley graphs

AU - Erde, Joshua

AU - Pitz, Max

AU - Lehner, Florian

PY - 2020

Y1 - 2020

N2 - We prove that any one-ended, locally finite Cayley graph G(Γ,S), where Γ is an abelian group and S is a finite generating set of non-torsion elements, admits a decomposition into edge-disjoint Hamiltonian (i.e. spanning) double-rays. In particular, the n-dimensional grid admits a decomposition into n edge-disjoint Hamiltonian double-rays for all n.

AB - We prove that any one-ended, locally finite Cayley graph G(Γ,S), where Γ is an abelian group and S is a finite generating set of non-torsion elements, admits a decomposition into edge-disjoint Hamiltonian (i.e. spanning) double-rays. In particular, the n-dimensional grid admits a decomposition into n edge-disjoint Hamiltonian double-rays for all n.

UR - https://www.sciencedirect.com/science/article/pii/S0095895619300541

M3 - Article

VL - 140

JO - Journal of Combinatorial Theory / B

JF - Journal of Combinatorial Theory / B

SN - 0095-8956

ER -