On finite fixed sets in infinite graphs (Q1331983)

An automorphism of a connected graph \(X\) is said to be a translation if it fixes a non-finite non-empty set of vertices of \(X\). A subgroup \(G\) of \(\Aut X\) has the finite-fixed-set property (FFSP) if there is a finite non-empty set \(L\) of vertices or ends of \(X\) such that \(g(l)= l\) for all \(l\in L\). Main result: \(G\) has the FFSP if and only if any two translations of \(G\) have a common fixed end. This theorem has several consequences, that were often known in special cases. For instance, if \(G\) contains no proper translation, then either \(G\) fixes a finite non- empty set of vertices or it has a unique fixed end.