Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
I finally found back the second reference (Csoka and Lippner) for the fact that every locally finite vertex-transitive graph is isomorphic to a Schreier graph! It only took me 28 months to do it.
Could you please explain why this is enough to conclude? As far as I understand, such a $b$ gives us a cyclic direct factor $C_{p^{k+1}}$, but I don't see how this is enough to obtain an infinite direct sum.
This is indeed a big sledgehammer, as in my context it would propably be better to avoid to talk about the Ulm-Kaplansky inviriants. Nevertheless, this is still a reference and I will take a look at Fuchs' book.