12.88 (1992)

Open

An undirected graph is called a locally finite Cayley graph of a group $G$ if its vertex set can be identified with the set of elements of $G$ in such a way that, for some finite generating set $X = X^{-1}$ of $G$ not containing 1, two vertices $g$ and $h$ are adjacent if and only if $g^{-1}h \in X$. Do there exist two finitely generated groups with the same locally finite Cayley graph, one of which is periodic and the other is not periodic?

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.