# Cayley graph properties

Consider an infinite graph that satisfies the following property: if any finite set of vertices is removed (and all the adjacent edges), then the resulting graph has only one infinite connected component.

So, obviously, the Cayley graph for the group $\mathbb Z \times \mathbb Z$ w.r.t. the standard generating set is an example. Obviously, the Cayley graph for a free group is not an example.

I have a question: what is the name of such a property? Has it been studied?

And the next question: which are the Cayley graphs with this property?

• For a graph with finite valency, it is called "one-ended graph" and it's been extensively studied (in the case of Cayley graphs, see for instance en.wikipedia.org/wiki/Stallings_theorem_about_ends_of_groups). If one allows infinite valency vertices, it is sometimes called "one-ended graph" (but there's then an inequivalent alternative definition of one-ended, replacing "finite" with "bounded).
– YCor
Jul 27, 2018 at 20:49
• Also, if a group has a finite generating set, and if the Cayley graph for some (equivalently, any) finite generating set is one-ended, then the group is called a one-ended group. Jul 28, 2018 at 0:46
• @YCor You should make this into an answer. The question is legitimate and well-posed, and you give an essentially complete answer, there is no reason for this to remain as a comment. Aug 2, 2018 at 11:39