Papers
Topics
Authors
Recent
2000 character limit reached

Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups (2006.09759v1)

Published 17 Jun 2020 in math.CO

Abstract: A well-known conjecture of Alspach says that every $2k$-regular Cayley graph of an abelian group can be decomposed into Hamiltonian cycles. We consider an analogous question for infinite abelian groups. In this setting one natural analogue of a Hamiltonian cycle is a spanning double-ray. However, a naive generalisation of Alspach's conjecture fails to hold in this setting due to the existence of $2k$-regular Cayley graphs with finite cuts $F$ where $|F|$ and $k$ differ in parity, which necessarily preclude the existence of a decomposition into spanning double-rays. We show that every $4$-regular Cayley graph of an infinite abelian group all of whose finite cuts are even can be decomposed into spanning double-rays, and so characterise when such decompositions exist. We also characterise when such graphs can be decomposed either into Hamiltonian circles, a more topological generalisation of a Hamiltonian cycle in infinite graphs, or into a Hamiltonian circle and a spanning double-ray.

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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